/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:28:17,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:28:17,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:28:17,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:28:17,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:28:17,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:28:17,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:28:17,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:28:17,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:28:17,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:28:17,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:28:17,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:28:17,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:28:17,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:28:17,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:28:17,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:28:17,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:28:17,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:28:17,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:28:17,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:28:17,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:28:17,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:28:17,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:28:17,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:28:17,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:28:17,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:28:17,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:28:17,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:28:17,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:28:17,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:28:17,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:28:17,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:28:17,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:28:17,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:28:18,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:28:18,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:28:18,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:28:18,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:28:18,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:28:18,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:28:18,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:28:18,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:28:18,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:28:18,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:28:18,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:28:18,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:28:18,033 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:28:18,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:28:18,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:28:18,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:28:18,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:28:18,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:28:18,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:28:18,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:28:18,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:28:18,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:28:18,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:28:18,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:28:18,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:28:18,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:28:18,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:28:18,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:28:18,036 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 11:28:18,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:28:18,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:28:18,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:28:18,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:28:18,295 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:28:18,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-13 11:28:19,154 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:28:19,415 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:28:19,416 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-13 11:28:19,428 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7919830cb/1a2377b1b0914e68864f0e249495d38d/FLAG6482ddf6d [2022-12-13 11:28:19,444 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7919830cb/1a2377b1b0914e68864f0e249495d38d [2022-12-13 11:28:19,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:28:19,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:28:19,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:28:19,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:28:19,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:28:19,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68afb5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19, skipping insertion in model container [2022-12-13 11:28:19,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:28:19,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:28:19,734 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-13 11:28:19,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:28:19,762 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:28:19,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-13 11:28:19,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:28:19,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:28:19,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:28:19,825 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:28:19,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19 WrapperNode [2022-12-13 11:28:19,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:28:19,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:28:19,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:28:19,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:28:19,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,857 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-13 11:28:19,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:28:19,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:28:19,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:28:19,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:28:19,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:28:19,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:28:19,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:28:19,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:28:19,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (1/1) ... [2022-12-13 11:28:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:28:19,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:19,897 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 11:28:19,915 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 11:28:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 11:28:19,943 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 11:28:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 11:28:19,943 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 11:28:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:28:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:28:19,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:28:19,946 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 11:28:20,029 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:28:20,030 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:28:20,147 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:28:20,151 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:28:20,151 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 11:28:20,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:28:20 BoogieIcfgContainer [2022-12-13 11:28:20,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:28:20,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:28:20,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:28:20,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:28:20,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:28:19" (1/3) ... [2022-12-13 11:28:20,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665851b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:28:20, skipping insertion in model container [2022-12-13 11:28:20,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:28:19" (2/3) ... [2022-12-13 11:28:20,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665851b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:28:20, skipping insertion in model container [2022-12-13 11:28:20,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:28:20" (3/3) ... [2022-12-13 11:28:20,159 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2022-12-13 11:28:20,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:28:20,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:28:20,173 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:28:20,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:28:20,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 11:28:20,317 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 11:28:20,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:28:20,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 11:28:20,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 11:28:20,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-13 11:28:20,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:20,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 11:28:20,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-13 11:28:20,362 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 11:28:20,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:28:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 11:28:20,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 11:28:20,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-13 11:28:23,241 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 11:28:23,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:28:23,256 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;@4dc5eb49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:28:23,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 11:28:23,259 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 11:28:23,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:28:23,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:23,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 11:28:23,261 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 11:28:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1807783243, now seen corresponding path program 1 times [2022-12-13 11:28:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:23,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585483779] [2022-12-13 11:28:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:23,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:23,501 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 11:28:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:23,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585483779] [2022-12-13 11:28:23,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585483779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:28:23,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:28:23,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:28:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060051668] [2022-12-13 11:28:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:28:23,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:28:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:23,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:28:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:28:23,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:23,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 11:28:23,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:23,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:23,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:23,679 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 11:28:23,679 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:28:23,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1007 events. 657/1007 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4231 event pairs, 175 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2022-12-13 11:28:23,689 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 38 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-13 11:28:23,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 178 flow [2022-12-13 11:28:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:28:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:28:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 11:28:23,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 11:28:23,700 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 11:28:23,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 178 flow [2022-12-13 11:28:23,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:28:23,704 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 70 flow [2022-12-13 11:28:23,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-13 11:28:23,709 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 11:28:23,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:23,710 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 70 flow [2022-12-13 11:28:23,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:23,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:23,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 70 flow [2022-12-13 11:28:23,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 70 flow [2022-12-13 11:28:23,716 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-13 11:28:23,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:28:23,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 11:28:23,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 70 flow [2022-12-13 11:28:23,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 11:28:23,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:28:23,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 11:28:23,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 70 flow [2022-12-13 11:28:23,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 11:28:23,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:23,727 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:23,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:28:23,730 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 11:28:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 206704716, now seen corresponding path program 1 times [2022-12-13 11:28:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:23,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921252742] [2022-12-13 11:28:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:23,806 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 11:28:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921252742] [2022-12-13 11:28:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921252742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842321393] [2022-12-13 11:28:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:23,811 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 11:28:23,852 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 11:28:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:23,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:23,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:23,953 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 11:28:23,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:23,980 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 11:28:23,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842321393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:23,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:23,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461973981] [2022-12-13 11:28:23,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:23,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:23,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 11:28:23,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:23,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:23,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 11:28:23,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:24,194 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 11:28:24,195 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 11:28:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1391 events. 913/1391 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 11:28:24,202 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 11:28:24,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 95 transitions, 392 flow [2022-12-13 11:28:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:28:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:28:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 11:28:24,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 11:28:24,205 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 70 flow. Second operand 6 states and 118 transitions. [2022-12-13 11:28:24,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 95 transitions, 392 flow [2022-12-13 11:28:24,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:28:24,208 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:28:24,209 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 11:28:24,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:24,209 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:24,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:24,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,213 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 11:28:24,214 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:28:24,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 11:28:24,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 11:28:24,410 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:28:24,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 11:28:24,412 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 11:28:24,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:24,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:24,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:24,421 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 11:28:24,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:24,621 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 11:28:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 206706204, now seen corresponding path program 1 times [2022-12-13 11:28:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:24,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143564297] [2022-12-13 11:28:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:24,682 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 11:28:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143564297] [2022-12-13 11:28:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143564297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548681580] [2022-12-13 11:28:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:24,684 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 11:28:24,686 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 11:28:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:24,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:24,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:24,751 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 11:28:24,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:24,761 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 11:28:24,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548681580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:24,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:24,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147209305] [2022-12-13 11:28:24,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:24,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:24,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:24,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:24,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:24,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:24,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:24,930 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 11:28:24,930 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 11:28:24,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 11:28:24,936 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 11:28:24,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 11:28:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:28:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:28:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 11:28:24,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 11:28:24,939 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 11:28:24,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 11:28:24,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 11:28:24,948 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:28:24,950 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 11:28:24,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:24,951 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:24,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:24,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,956 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 11:28:24,956 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:28:24,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 11:28:24,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:24,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 11:28:25,146 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:28:25,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 11:28:25,147 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 11:28:25,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:25,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:25,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:25,154 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 11:28:25,347 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,SelfDestructingSolverStorable2 [2022-12-13 11:28:25,348 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 11:28:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 206706297, now seen corresponding path program 1 times [2022-12-13 11:28:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034085903] [2022-12-13 11:28:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:25,393 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 11:28:25,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034085903] [2022-12-13 11:28:25,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034085903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537602233] [2022-12-13 11:28:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:25,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:25,407 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 11:28:25,408 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 11:28:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:25,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:25,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:25,466 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 11:28:25,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:25,481 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 11:28:25,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537602233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:25,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:25,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104764167] [2022-12-13 11:28:25,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:25,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:25,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:25,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:25,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:25,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:25,619 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 11:28:25,619 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 11:28:25,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 11:28:25,626 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 11:28:25,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 11:28:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:28:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:28:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 11:28:25,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 11:28:25,628 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 11:28:25,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 11:28:25,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 11:28:25,633 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:25,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:28:25,634 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 11:28:25,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:25,635 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:25,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:25,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:25,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:25,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:25,639 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 11:28:25,639 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:28:25,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 11:28:25,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 11:28:25,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 11:28:25,819 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:28:25,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 11:28:25,819 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 11:28:25,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:25,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:25,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:25,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 11:28:26,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:26,020 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 11:28:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 206706390, now seen corresponding path program 1 times [2022-12-13 11:28:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:26,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539526335] [2022-12-13 11:28:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:26,065 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 11:28:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:26,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539526335] [2022-12-13 11:28:26,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539526335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:26,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910561232] [2022-12-13 11:28:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:26,067 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 11:28:26,093 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 11:28:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:26,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:26,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:26,150 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 11:28:26,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:26,159 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 11:28:26,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910561232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:26,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:26,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229448038] [2022-12-13 11:28:26,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:26,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:26,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:26,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:26,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:26,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:26,272 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 11:28:26,273 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-13 11:28:26,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1199 events. 785/1199 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3357. Up to 449 conditions per place. [2022-12-13 11:28:26,278 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 11:28:26,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 342 flow [2022-12-13 11:28:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:28:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:28:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 11:28:26,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 11:28:26,279 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 5 states and 96 transitions. [2022-12-13 11:28:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 342 flow [2022-12-13 11:28:26,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 11:28:26,282 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 11:28:26,283 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 11:28:26,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:26,283 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:26,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:26,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,285 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 11:28:26,285 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:28:26,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 11:28:26,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 11:28:26,393 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:28:26,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 11:28:26,394 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 11:28:26,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:26,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:26,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:26,400 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 11:28:26,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:26,599 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 11:28:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash 206706452, now seen corresponding path program 1 times [2022-12-13 11:28:26,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:26,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036462387] [2022-12-13 11:28:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:26,623 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 11:28:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:26,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036462387] [2022-12-13 11:28:26,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036462387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:26,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524427454] [2022-12-13 11:28:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:26,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:26,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:26,625 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 11:28:26,627 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 11:28:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:26,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:26,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:26,686 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 11:28:26,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:26,695 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 11:28:26,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524427454] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:26,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:26,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535333971] [2022-12-13 11:28:26,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:26,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:26,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:26,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:26,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:26,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:26,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:26,793 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 11:28:26,793 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 11:28:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 11:28:26,797 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 11:28:26,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 11:28:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:28:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:28:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 11:28:26,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 11:28:26,798 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 11:28:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 11:28:26,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 11:28:26,800 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 11:28:26,800 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 11:28:26,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:26,801 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:26,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:26,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,803 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 11:28:26,803 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:28:26,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 11:28:26,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:26,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 11:28:26,911 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:28:26,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 11:28:26,911 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 11:28:26,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:26,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:26,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:26,921 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 11:28:27,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:27,116 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 11:28:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 206706514, now seen corresponding path program 1 times [2022-12-13 11:28:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:27,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127637206] [2022-12-13 11:28:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:27,139 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 11:28:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127637206] [2022-12-13 11:28:27,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127637206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574858535] [2022-12-13 11:28:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:27,141 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 11:28:27,144 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 11:28:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:27,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:28:27,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:27,201 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 11:28:27,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:27,213 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 11:28:27,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574858535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:27,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:27,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 11:28:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90922989] [2022-12-13 11:28:27,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:27,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:28:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:28:27,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:28:27,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:27,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:27,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:27,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:27,327 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 11:28:27,327 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 11:28:27,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 11:28:27,332 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 11:28:27,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 11:28:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:28:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:28:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 11:28:27,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 11:28:27,333 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 11:28:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 11:28:27,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 11:28:27,335 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:27,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 11:28:27,336 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 11:28:27,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:27,337 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:27,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:27,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:27,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:27,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:27,340 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 11:28:27,340 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:28:27,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 11:28:27,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 11:28:27,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 11:28:27,483 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:28:27,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 11:28:27,484 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 11:28:27,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 11:28:27,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:27,484 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:27,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 11:28:27,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:27,690 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 11:28:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 206706576, now seen corresponding path program 1 times [2022-12-13 11:28:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:27,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134134465] [2022-12-13 11:28:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:28:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134134465] [2022-12-13 11:28:27,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134134465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463289739] [2022-12-13 11:28:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:27,838 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 11:28:27,854 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 11:28:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:27,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 11:28:27,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:27,935 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 11:28:27,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:28,158 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 11:28:28,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463289739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:28,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:28,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 11:28:28,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696141087] [2022-12-13 11:28:28,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:28,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:28:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:28,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:28:28,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:28:28,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 11:28:28,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 11:28:28,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:28,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 11:28:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:30,503 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 [1] [2022-12-13 11:28:30,705 INFO L130 PetriNetUnfolder]: 1705/2520 cut-off events. [2022-12-13 11:28:30,706 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-13 11:28:30,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6557 conditions, 2520 events. 1705/2520 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 11995 event pairs, 96 based on Foata normal form. 133/1357 useless extension candidates. Maximal degree in co-relation 6543. Up to 1339 conditions per place. [2022-12-13 11:28:30,717 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2022-12-13 11:28:30,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 139 transitions, 626 flow [2022-12-13 11:28:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:28:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:28:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 11:28:30,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-12-13 11:28:30,719 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 8 states and 170 transitions. [2022-12-13 11:28:30,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 139 transitions, 626 flow [2022-12-13 11:28:30,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 139 transitions, 582 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 11:28:30,722 INFO L231 Difference]: Finished difference. Result has 41 places, 83 transitions, 367 flow [2022-12-13 11:28:30,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=41, PETRI_TRANSITIONS=83} [2022-12-13 11:28:30,723 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-13 11:28:30,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:30,723 INFO L89 Accepts]: Start accepts. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 11:28:30,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:30,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:30,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 11:28:30,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 83 transitions, 367 flow [2022-12-13 11:28:30,739 INFO L130 PetriNetUnfolder]: 329/501 cut-off events. [2022-12-13 11:28:30,739 INFO L131 PetriNetUnfolder]: For 147/155 co-relation queries the response was YES. [2022-12-13 11:28:30,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 501 events. 329/501 cut-off events. For 147/155 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1927 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 1200. Up to 377 conditions per place. [2022-12-13 11:28:30,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 83 transitions, 367 flow [2022-12-13 11:28:30,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-13 11:28:30,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 11:28:30,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:30,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 11:28:30,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:28:30,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 11:28:30,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:31,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:31,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:28:31,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 11:28:31,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:31,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 11:28:31,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:28:31,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 11:28:31,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:31,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:28:31,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:28:31,577 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:28:31,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 856 [2022-12-13 11:28:31,579 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 82 transitions, 442 flow [2022-12-13 11:28:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 11:28:31,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:31,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:31,586 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 11:28:31,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:31,784 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 11:28:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 206706824, now seen corresponding path program 1 times [2022-12-13 11:28:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:31,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584762099] [2022-12-13 11:28:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:31,826 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 11:28:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584762099] [2022-12-13 11:28:31,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584762099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:28:31,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:28:31,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:28:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329574790] [2022-12-13 11:28:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:28:31,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:28:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:28:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:28:31,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2022-12-13 11:28:31,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 82 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 11:28:31,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:31,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2022-12-13 11:28:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:31,932 INFO L130 PetriNetUnfolder]: 1152/1728 cut-off events. [2022-12-13 11:28:31,932 INFO L131 PetriNetUnfolder]: For 1044/1044 co-relation queries the response was YES. [2022-12-13 11:28:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 1728 events. 1152/1728 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 8061 event pairs, 378 based on Foata normal form. 54/994 useless extension candidates. Maximal degree in co-relation 5190. Up to 890 conditions per place. [2022-12-13 11:28:31,939 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 63 selfloop transitions, 18 changer transitions 1/86 dead transitions. [2022-12-13 11:28:31,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 86 transitions, 594 flow [2022-12-13 11:28:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:28:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:28:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 11:28:31,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-13 11:28:31,940 INFO L175 Difference]: Start difference. First operand has 40 places, 82 transitions, 442 flow. Second operand 3 states and 70 transitions. [2022-12-13 11:28:31,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 86 transitions, 594 flow [2022-12-13 11:28:31,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 86 transitions, 556 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 11:28:31,948 INFO L231 Difference]: Finished difference. Result has 40 places, 69 transitions, 373 flow [2022-12-13 11:28:31,948 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=40, PETRI_TRANSITIONS=69} [2022-12-13 11:28:31,949 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-13 11:28:31,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:28:31,949 INFO L89 Accepts]: Start accepts. Operand has 40 places, 69 transitions, 373 flow [2022-12-13 11:28:31,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:28:31,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:28:31,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 69 transitions, 373 flow [2022-12-13 11:28:31,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 69 transitions, 373 flow [2022-12-13 11:28:31,963 INFO L130 PetriNetUnfolder]: 272/441 cut-off events. [2022-12-13 11:28:31,964 INFO L131 PetriNetUnfolder]: For 182/190 co-relation queries the response was YES. [2022-12-13 11:28:31,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 441 events. 272/441 cut-off events. For 182/190 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1769 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1105. Up to 321 conditions per place. [2022-12-13 11:28:31,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 69 transitions, 373 flow [2022-12-13 11:28:31,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 11:28:31,967 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:28:31,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 11:28:31,968 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 69 transitions, 373 flow [2022-12-13 11:28:31,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 11:28:31,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:28:31,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:28:31,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:28:31,968 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 11:28:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1349048229, now seen corresponding path program 1 times [2022-12-13 11:28:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:31,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815997908] [2022-12-13 11:28:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,118 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 11:28:32,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:32,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815997908] [2022-12-13 11:28:32,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815997908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:32,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895528061] [2022-12-13 11:28:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:32,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:32,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:28:32,120 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 11:28:32,122 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 11:28:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 11:28:32,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:32,248 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 11:28:32,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:32,482 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 11:28:32,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895528061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:32,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:32,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 11:28:32,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524482408] [2022-12-13 11:28:32,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:32,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:28:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:28:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:28:32,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:28:32,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 69 transitions, 373 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 11:28:32,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:28:32,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:28:32,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:28:37,095 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 [1] [2022-12-13 11:28:39,292 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 [1] [2022-12-13 11:28:41,298 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 [1] [2022-12-13 11:28:43,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:28:45,681 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 [1] [2022-12-13 11:28:47,928 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 [1] [2022-12-13 11:28:49,934 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 [1] [2022-12-13 11:28:52,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:28:54,503 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 [1] [2022-12-13 11:28:56,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 [1] [2022-12-13 11:28:58,514 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 [1] [2022-12-13 11:29:01,540 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 [1] [2022-12-13 11:29:03,545 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 [1] [2022-12-13 11:29:03,780 INFO L130 PetriNetUnfolder]: 2780/4191 cut-off events. [2022-12-13 11:29:03,780 INFO L131 PetriNetUnfolder]: For 3076/3076 co-relation queries the response was YES. [2022-12-13 11:29:03,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12383 conditions, 4191 events. 2780/4191 cut-off events. For 3076/3076 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 23555 event pairs, 100 based on Foata normal form. 168/2447 useless extension candidates. Maximal degree in co-relation 12367. Up to 2080 conditions per place. [2022-12-13 11:29:03,795 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 110 selfloop transitions, 131 changer transitions 0/245 dead transitions. [2022-12-13 11:29:03,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 245 transitions, 1490 flow [2022-12-13 11:29:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:29:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 11:29:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-12-13 11:29:03,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 11:29:03,797 INFO L175 Difference]: Start difference. First operand has 39 places, 69 transitions, 373 flow. Second operand 12 states and 276 transitions. [2022-12-13 11:29:03,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 245 transitions, 1490 flow [2022-12-13 11:29:03,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 245 transitions, 1426 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 11:29:03,838 INFO L231 Difference]: Finished difference. Result has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1121, PETRI_PLACES=51, PETRI_TRANSITIONS=159} [2022-12-13 11:29:03,839 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 11:29:03,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:29:03,839 INFO L89 Accepts]: Start accepts. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:29:03,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:29:03,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,879 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-13 11:29:03,879 INFO L131 PetriNetUnfolder]: For 711/766 co-relation queries the response was YES. [2022-12-13 11:29:03,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1017 events. 604/1017 cut-off events. For 711/766 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5507 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 3341. Up to 777 conditions per place. [2022-12-13 11:29:03,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 11:29:03,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:29:03,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 11:29:03,888 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 159 transitions, 1121 flow [2022-12-13 11:29:03,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 11:29:03,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:29:03,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:29:03,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:29:04,093 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,SelfDestructingSolverStorable9 [2022-12-13 11:29:04,096 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 11:29:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:29:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1348900855, now seen corresponding path program 1 times [2022-12-13 11:29:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:29:04,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946534091] [2022-12-13 11:29:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:29:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:29:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:29:04,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946534091] [2022-12-13 11:29:04,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946534091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:29:04,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173998731] [2022-12-13 11:29:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:29:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:29:04,132 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 11:29:04,134 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 11:29:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:04,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:29:04,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:29:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:29:04,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:29:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173998731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:29:04,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:29:04,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 11:29:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297049397] [2022-12-13 11:29:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:29:04,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:29:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:29:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:29:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:29:04,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:29:04,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 159 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 11:29:04,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:29:04,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:29:04,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:29:04,382 INFO L130 PetriNetUnfolder]: 1996/3185 cut-off events. [2022-12-13 11:29:04,382 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 11:29:04,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 3185 events. 1996/3185 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 18964 event pairs, 727 based on Foata normal form. 350/1903 useless extension candidates. Maximal degree in co-relation 10853. Up to 1634 conditions per place. [2022-12-13 11:29:04,392 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 133 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2022-12-13 11:29:04,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 165 transitions, 1428 flow [2022-12-13 11:29:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:29:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:29:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 11:29:04,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 11:29:04,393 INFO L175 Difference]: Start difference. First operand has 51 places, 159 transitions, 1121 flow. Second operand 4 states and 72 transitions. [2022-12-13 11:29:04,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 165 transitions, 1428 flow [2022-12-13 11:29:04,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 165 transitions, 1295 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-13 11:29:04,414 INFO L231 Difference]: Finished difference. Result has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=949, PETRI_PLACES=52, PETRI_TRANSITIONS=141} [2022-12-13 11:29:04,414 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 11:29:04,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:29:04,414 INFO L89 Accepts]: Start accepts. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:29:04,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:29:04,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,440 INFO L130 PetriNetUnfolder]: 424/781 cut-off events. [2022-12-13 11:29:04,441 INFO L131 PetriNetUnfolder]: For 772/807 co-relation queries the response was YES. [2022-12-13 11:29:04,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 781 events. 424/781 cut-off events. For 772/807 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4562 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 2281. Up to 405 conditions per place. [2022-12-13 11:29:04,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 11:29:04,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:29:04,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 11:29:04,446 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 141 transitions, 949 flow [2022-12-13 11:29:04,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 11:29:04,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:29:04,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:29:04,452 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 11:29:04,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:29:04,652 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 11:29:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:29:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1025623741, now seen corresponding path program 1 times [2022-12-13 11:29:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:29:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473599404] [2022-12-13 11:29:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:29:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:04,762 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 11:29:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:29:04,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473599404] [2022-12-13 11:29:04,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473599404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:29:04,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107410792] [2022-12-13 11:29:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:04,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:29:04,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:29:04,764 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 11:29:04,790 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 11:29:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:04,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 11:29:04,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:29:04,889 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 11:29:04,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:29:05,067 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 11:29:05,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107410792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:29:05,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:29:05,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 11:29:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721954516] [2022-12-13 11:29:05,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:29:05,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:29:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:29:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:29:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:29:05,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 11:29:05,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 141 transitions, 949 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 11:29:05,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:29:05,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 11:29:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:29:10,416 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 [1] [2022-12-13 11:29:13,072 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 [1] [2022-12-13 11:29:15,077 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 [1] [2022-12-13 11:29:17,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:29:17,717 INFO L130 PetriNetUnfolder]: 3207/5195 cut-off events. [2022-12-13 11:29:17,717 INFO L131 PetriNetUnfolder]: For 7682/7682 co-relation queries the response was YES. [2022-12-13 11:29:17,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 5195 events. 3207/5195 cut-off events. For 7682/7682 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 34561 event pairs, 163 based on Foata normal form. 168/2671 useless extension candidates. Maximal degree in co-relation 16240. Up to 2896 conditions per place. [2022-12-13 11:29:17,733 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 137 selfloop transitions, 157 changer transitions 0/298 dead transitions. [2022-12-13 11:29:17,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 298 transitions, 2101 flow [2022-12-13 11:29:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:29:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 11:29:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 11:29:17,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2022-12-13 11:29:17,735 INFO L175 Difference]: Start difference. First operand has 52 places, 141 transitions, 949 flow. Second operand 11 states and 242 transitions. [2022-12-13 11:29:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 298 transitions, 2101 flow [2022-12-13 11:29:17,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 298 transitions, 2068 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:29:17,792 INFO L231 Difference]: Finished difference. Result has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1894, PETRI_PLACES=66, PETRI_TRANSITIONS=225} [2022-12-13 11:29:17,793 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-13 11:29:17,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:29:17,794 INFO L89 Accepts]: Start accepts. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:29:17,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:29:17,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,841 INFO L130 PetriNetUnfolder]: 640/1265 cut-off events. [2022-12-13 11:29:17,841 INFO L131 PetriNetUnfolder]: For 2505/2567 co-relation queries the response was YES. [2022-12-13 11:29:17,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1265 events. 640/1265 cut-off events. For 2505/2567 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 8828 event pairs, 0 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 4977. Up to 733 conditions per place. [2022-12-13 11:29:17,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 11:29:17,850 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:29:17,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 11:29:17,851 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 225 transitions, 1894 flow [2022-12-13 11:29:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 11:29:17,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:29:17,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:29:17,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:29:18,055 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,SelfDestructingSolverStorable11 [2022-12-13 11:29:18,056 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 11:29:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:29:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1134579712, now seen corresponding path program 1 times [2022-12-13 11:29:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:29:18,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661666988] [2022-12-13 11:29:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:29:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:18,205 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 11:29:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:29:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661666988] [2022-12-13 11:29:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661666988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:29:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205940702] [2022-12-13 11:29:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:18,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:29:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:29:18,207 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 11:29:18,209 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 11:29:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:18,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 11:29:18,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:29:18,349 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 11:29:18,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:29:18,621 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 11:29:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205940702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:29:18,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:29:18,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 11:29:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018349995] [2022-12-13 11:29:18,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:29:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:29:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:29:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:29:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:29:18,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 11:29:18,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 225 transitions, 1894 flow. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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 11:29:18,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:29:18,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 11:29:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:29:22,535 INFO L130 PetriNetUnfolder]: 4901/7978 cut-off events. [2022-12-13 11:29:22,535 INFO L131 PetriNetUnfolder]: For 25009/25009 co-relation queries the response was YES. [2022-12-13 11:29:22,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31146 conditions, 7978 events. 4901/7978 cut-off events. For 25009/25009 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 57070 event pairs, 202 based on Foata normal form. 154/4045 useless extension candidates. Maximal degree in co-relation 31120. Up to 3237 conditions per place. [2022-12-13 11:29:22,560 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 142 selfloop transitions, 251 changer transitions 0/397 dead transitions. [2022-12-13 11:29:22,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 397 transitions, 3424 flow [2022-12-13 11:29:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:29:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 11:29:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2022-12-13 11:29:22,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368217054263565 [2022-12-13 11:29:22,562 INFO L175 Difference]: Start difference. First operand has 66 places, 225 transitions, 1894 flow. Second operand 12 states and 277 transitions. [2022-12-13 11:29:22,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 397 transitions, 3424 flow [2022-12-13 11:29:22,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 397 transitions, 3245 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 11:29:22,712 INFO L231 Difference]: Finished difference. Result has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3010, PETRI_PLACES=78, PETRI_TRANSITIONS=302} [2022-12-13 11:29:22,713 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 11:29:22,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:29:22,713 INFO L89 Accepts]: Start accepts. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:29:22,715 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:29:22,715 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,803 INFO L130 PetriNetUnfolder]: 968/1965 cut-off events. [2022-12-13 11:29:22,803 INFO L131 PetriNetUnfolder]: For 7615/7686 co-relation queries the response was YES. [2022-12-13 11:29:22,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9477 conditions, 1965 events. 968/1965 cut-off events. For 7615/7686 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 15303 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 9449. Up to 1165 conditions per place. [2022-12-13 11:29:22,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 3424 [2022-12-13 11:29:22,817 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:29:22,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 11:29:22,818 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 302 transitions, 3010 flow [2022-12-13 11:29:22,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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 11:29:22,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:29:22,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:29:22,822 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 11:29:23,022 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,SelfDestructingSolverStorable12 [2022-12-13 11:29:23,023 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 11:29:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:29:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1931262146, now seen corresponding path program 1 times [2022-12-13 11:29:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:29:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891414678] [2022-12-13 11:29:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:29:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:23,148 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 11:29:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:29:23,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891414678] [2022-12-13 11:29:23,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891414678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:29:23,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631297501] [2022-12-13 11:29:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:29:23,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:29:23,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:29:23,150 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 11:29:23,152 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 11:29:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:29:23,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:29:23,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:29:23,292 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 11:29:23,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:29:23,505 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 11:29:23,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631297501] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:29:23,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:29:23,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 11:29:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834130850] [2022-12-13 11:29:23,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:29:23,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:29:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:29:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:29:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:29:23,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 11:29:23,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 302 transitions, 3010 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:29:23,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:29:23,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 11:29:23,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:29:30,718 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:29:36,517 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 [1] [2022-12-13 11:29:38,527 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 [1] [2022-12-13 11:29:40,615 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 [1] [2022-12-13 11:29:42,956 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 [1] [2022-12-13 11:29:44,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:29:47,058 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 [1] [2022-12-13 11:29:48,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:29:50,922 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 [1] [2022-12-13 11:29:57,700 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 [1] [2022-12-13 11:30:00,322 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 [1] [2022-12-13 11:30:02,332 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 [1] [2022-12-13 11:30:04,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:05,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:06,476 INFO L130 PetriNetUnfolder]: 4964/8221 cut-off events. [2022-12-13 11:30:06,476 INFO L131 PetriNetUnfolder]: For 48558/48558 co-relation queries the response was YES. [2022-12-13 11:30:06,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36331 conditions, 8221 events. 4964/8221 cut-off events. For 48558/48558 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 60171 event pairs, 259 based on Foata normal form. 308/4232 useless extension candidates. Maximal degree in co-relation 36300. Up to 4886 conditions per place. [2022-12-13 11:30:06,500 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 220 selfloop transitions, 240 changer transitions 12/476 dead transitions. [2022-12-13 11:30:06,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 476 transitions, 4734 flow [2022-12-13 11:30:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:30:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 11:30:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 343 transitions. [2022-12-13 11:30:06,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4692202462380301 [2022-12-13 11:30:06,504 INFO L175 Difference]: Start difference. First operand has 78 places, 302 transitions, 3010 flow. Second operand 17 states and 343 transitions. [2022-12-13 11:30:06,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 476 transitions, 4734 flow [2022-12-13 11:30:06,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 476 transitions, 4319 flow, removed 89 selfloop flow, removed 8 redundant places. [2022-12-13 11:30:06,861 INFO L231 Difference]: Finished difference. Result has 90 places, 360 transitions, 3840 flow [2022-12-13 11:30:06,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3840, PETRI_PLACES=90, PETRI_TRANSITIONS=360} [2022-12-13 11:30:06,862 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 11:30:06,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:30:06,862 INFO L89 Accepts]: Start accepts. Operand has 90 places, 360 transitions, 3840 flow [2022-12-13 11:30:06,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:30:06,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:30:06,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 360 transitions, 3840 flow [2022-12-13 11:30:06,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 360 transitions, 3840 flow [2022-12-13 11:30:07,027 INFO L130 PetriNetUnfolder]: 1185/2303 cut-off events. [2022-12-13 11:30:07,027 INFO L131 PetriNetUnfolder]: For 7959/8030 co-relation queries the response was YES. [2022-12-13 11:30:07,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11253 conditions, 2303 events. 1185/2303 cut-off events. For 7959/8030 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 17368 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 11225. Up to 1359 conditions per place. [2022-12-13 11:30:07,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 360 transitions, 3840 flow [2022-12-13 11:30:07,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 3840 [2022-12-13 11:30:07,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:30:07,186 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:30:07,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-13 11:30:07,187 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 358 transitions, 3822 flow [2022-12-13 11:30:07,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:30:07,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:30:07,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:30:07,194 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 11:30:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 11:30:07,388 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 11:30:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:30:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1930074784, now seen corresponding path program 1 times [2022-12-13 11:30:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:30:07,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911396261] [2022-12-13 11:30:07,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:30:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:30:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:07,513 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 11:30:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:30:07,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911396261] [2022-12-13 11:30:07,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911396261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:30:07,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157316625] [2022-12-13 11:30:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:30:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:30:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:30:07,514 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 11:30:07,516 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 11:30:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:07,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:30:07,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:30:07,666 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 11:30:07,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:30:07,870 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 11:30:07,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157316625] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:30:07,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:30:07,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 11:30:07,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198830218] [2022-12-13 11:30:07,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:30:07,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:30:07,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:30:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:30:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:30:07,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:30:07,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 358 transitions, 3822 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:30:07,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:30:07,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:30:07,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:30:09,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:16,428 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 [1] [2022-12-13 11:30:17,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:19,868 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 [1] [2022-12-13 11:30:22,858 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 [1] [2022-12-13 11:30:28,463 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 [1] [2022-12-13 11:30:29,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:31,532 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 [1] [2022-12-13 11:30:33,918 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 [1] [2022-12-13 11:30:35,925 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 [1] [2022-12-13 11:30:37,932 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 [1] [2022-12-13 11:30:40,012 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 [1] [2022-12-13 11:30:40,535 INFO L130 PetriNetUnfolder]: 5570/9503 cut-off events. [2022-12-13 11:30:40,536 INFO L131 PetriNetUnfolder]: For 42923/42923 co-relation queries the response was YES. [2022-12-13 11:30:40,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42810 conditions, 9503 events. 5570/9503 cut-off events. For 42923/42923 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 74705 event pairs, 331 based on Foata normal form. 196/4524 useless extension candidates. Maximal degree in co-relation 42779. Up to 5340 conditions per place. [2022-12-13 11:30:40,562 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 254 selfloop transitions, 327 changer transitions 3/588 dead transitions. [2022-12-13 11:30:40,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 588 transitions, 6530 flow [2022-12-13 11:30:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:30:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 11:30:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 336 transitions. [2022-12-13 11:30:40,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-13 11:30:40,565 INFO L175 Difference]: Start difference. First operand has 88 places, 358 transitions, 3822 flow. Second operand 16 states and 336 transitions. [2022-12-13 11:30:40,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 588 transitions, 6530 flow [2022-12-13 11:30:41,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 588 transitions, 6175 flow, removed 51 selfloop flow, removed 9 redundant places. [2022-12-13 11:30:41,099 INFO L231 Difference]: Finished difference. Result has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5832, PETRI_PLACES=99, PETRI_TRANSITIONS=479} [2022-12-13 11:30:41,100 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 11:30:41,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:30:41,100 INFO L89 Accepts]: Start accepts. Operand has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:30:41,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:30:41,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,273 INFO L130 PetriNetUnfolder]: 1425/2879 cut-off events. [2022-12-13 11:30:41,273 INFO L131 PetriNetUnfolder]: For 10627/10707 co-relation queries the response was YES. [2022-12-13 11:30:41,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15683 conditions, 2879 events. 1425/2879 cut-off events. For 10627/10707 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 23752 event pairs, 0 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 15650. Up to 1727 conditions per place. [2022-12-13 11:30:41,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 4824 [2022-12-13 11:30:41,290 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:30:41,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-13 11:30:41,291 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 479 transitions, 5832 flow [2022-12-13 11:30:41,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:30:41,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:30:41,291 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:30:41,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 11:30:41,491 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,SelfDestructingSolverStorable14 [2022-12-13 11:30:41,492 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 11:30:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:30:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2075009868, now seen corresponding path program 1 times [2022-12-13 11:30:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:30:41,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638886187] [2022-12-13 11:30:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:30:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:30:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:41,624 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 11:30:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:30:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638886187] [2022-12-13 11:30:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638886187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:30:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374892066] [2022-12-13 11:30:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:30:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:30:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:30:41,628 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 11:30:41,634 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 11:30:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:41,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:30:41,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:30:41,783 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 11:30:41,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:30:42,080 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 11:30:42,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374892066] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:30:42,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:30:42,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:30:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177075323] [2022-12-13 11:30:42,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:30:42,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:30:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:30:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:30:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:30:42,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:30:42,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 479 transitions, 5832 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 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 11:30:42,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:30:42,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:30:42,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:30:44,709 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 [1] [2022-12-13 11:30:48,836 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 [1] [2022-12-13 11:30:52,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:30:55,578 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 [1] [2022-12-13 11:31:00,024 INFO L130 PetriNetUnfolder]: 7859/13379 cut-off events. [2022-12-13 11:31:00,025 INFO L131 PetriNetUnfolder]: For 79717/79717 co-relation queries the response was YES. [2022-12-13 11:31:00,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66970 conditions, 13379 events. 7859/13379 cut-off events. For 79717/79717 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 110157 event pairs, 412 based on Foata normal form. 147/6344 useless extension candidates. Maximal degree in co-relation 66934. Up to 5534 conditions per place. [2022-12-13 11:31:00,070 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 307 selfloop transitions, 422 changer transitions 6/739 dead transitions. [2022-12-13 11:31:00,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 739 transitions, 9321 flow [2022-12-13 11:31:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:31:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 11:31:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 334 transitions. [2022-12-13 11:31:00,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2022-12-13 11:31:00,071 INFO L175 Difference]: Start difference. First operand has 99 places, 479 transitions, 5832 flow. Second operand 15 states and 334 transitions. [2022-12-13 11:31:00,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 739 transitions, 9321 flow [2022-12-13 11:31:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 739 transitions, 8906 flow, removed 81 selfloop flow, removed 8 redundant places. [2022-12-13 11:31:00,930 INFO L231 Difference]: Finished difference. Result has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:00,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5449, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8394, PETRI_PLACES=109, PETRI_TRANSITIONS=620} [2022-12-13 11:31:00,931 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 11:31:00,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:31:00,931 INFO L89 Accepts]: Start accepts. Operand has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:00,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:31:00,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:31:00,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:00,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:01,220 INFO L130 PetriNetUnfolder]: 2121/4226 cut-off events. [2022-12-13 11:31:01,220 INFO L131 PetriNetUnfolder]: For 25622/25693 co-relation queries the response was YES. [2022-12-13 11:31:01,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26424 conditions, 4226 events. 2121/4226 cut-off events. For 25622/25693 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 36100 event pairs, 24 based on Foata normal form. 0/1364 useless extension candidates. Maximal degree in co-relation 26386. Up to 2551 conditions per place. [2022-12-13 11:31:01,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:01,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 6182 [2022-12-13 11:31:01,245 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:31:01,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-13 11:31:01,245 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 620 transitions, 8394 flow [2022-12-13 11:31:01,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 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 11:31:01,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:31:01,246 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:31:01,250 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 11:31:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:31:01,446 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 11:31:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:31:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash -262818095, now seen corresponding path program 1 times [2022-12-13 11:31:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:31:01,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815613043] [2022-12-13 11:31:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:31:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:31:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:31:01,557 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 11:31:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:31:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815613043] [2022-12-13 11:31:01,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815613043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:31:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342994901] [2022-12-13 11:31:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:31:01,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:31:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:31:01,559 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 11:31:01,560 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 11:31:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:31:01,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:31:01,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:31:01,756 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 11:31:01,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:31:02,031 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 11:31:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342994901] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:31:02,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:31:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:31:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101648617] [2022-12-13 11:31:02,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:31:02,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:31:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:31:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:31:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:31:02,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:31:02,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 620 transitions, 8394 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:31:02,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:31:02,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:31:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:31:12,896 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 60 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:31:15,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:31:17,124 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 [1] [2022-12-13 11:31:20,548 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 [1] [2022-12-13 11:31:22,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 [1] [2022-12-13 11:31:28,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:31:31,562 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 [1] [2022-12-13 11:31:33,645 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 [1] [2022-12-13 11:31:35,654 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 [1] [2022-12-13 11:31:37,663 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 [1] [2022-12-13 11:31:41,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 [1] [2022-12-13 11:31:43,297 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 [1] [2022-12-13 11:31:45,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:31:48,923 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 [1] [2022-12-13 11:31:51,082 INFO L130 PetriNetUnfolder]: 11164/19246 cut-off events. [2022-12-13 11:31:51,083 INFO L131 PetriNetUnfolder]: For 197216/197216 co-relation queries the response was YES. [2022-12-13 11:31:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107483 conditions, 19246 events. 11164/19246 cut-off events. For 197216/197216 co-relation queries the response was YES. Maximal size of possible extension queue 2317. Compared 168289 event pairs, 438 based on Foata normal form. 350/9162 useless extension candidates. Maximal degree in co-relation 107442. Up to 8006 conditions per place. [2022-12-13 11:31:51,165 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 287 selfloop transitions, 764 changer transitions 0/1055 dead transitions. [2022-12-13 11:31:51,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 1055 transitions, 14476 flow [2022-12-13 11:31:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 11:31:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 11:31:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 502 transitions. [2022-12-13 11:31:51,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4753787878787879 [2022-12-13 11:31:51,167 INFO L175 Difference]: Start difference. First operand has 109 places, 620 transitions, 8394 flow. Second operand 24 states and 502 transitions. [2022-12-13 11:31:51,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 1055 transitions, 14476 flow [2022-12-13 11:31:53,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1055 transitions, 13857 flow, removed 232 selfloop flow, removed 6 redundant places. [2022-12-13 11:31:53,174 INFO L231 Difference]: Finished difference. Result has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7899, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=526, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=13983, PETRI_PLACES=136, PETRI_TRANSITIONS=884} [2022-12-13 11:31:53,175 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2022-12-13 11:31:53,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:31:53,175 INFO L89 Accepts]: Start accepts. Operand has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:31:53,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:31:53,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,715 INFO L130 PetriNetUnfolder]: 2905/6114 cut-off events. [2022-12-13 11:31:53,715 INFO L131 PetriNetUnfolder]: For 59235/59342 co-relation queries the response was YES. [2022-12-13 11:31:53,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43886 conditions, 6114 events. 2905/6114 cut-off events. For 59235/59342 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 58341 event pairs, 24 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 43840. Up to 3190 conditions per place. [2022-12-13 11:31:53,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 8566 [2022-12-13 11:31:53,763 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:31:53,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 589 [2022-12-13 11:31:53,764 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 884 transitions, 13983 flow [2022-12-13 11:31:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:31:53,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:31:53,764 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:31:53,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 11:31:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 11:31:53,969 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 11:31:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:31:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 591512814, now seen corresponding path program 1 times [2022-12-13 11:31:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:31:53,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325391974] [2022-12-13 11:31:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:31:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:31:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:31:54,141 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 11:31:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:31:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325391974] [2022-12-13 11:31:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325391974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:31:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614212768] [2022-12-13 11:31:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:31:54,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:31:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:31:54,161 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 11:31:54,161 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 11:31:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:31:54,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 11:31:54,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:31:54,330 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 11:31:54,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:31:54,653 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 11:31:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614212768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:31:54,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:31:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:31:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171224251] [2022-12-13 11:31:54,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:31:54,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:31:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:31:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:31:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:31:54,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:31:54,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 884 transitions, 13983 flow. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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 11:31:54,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:31:54,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:31:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:31:57,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:01,144 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 [1] [2022-12-13 11:32:04,027 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 [1] [2022-12-13 11:32:05,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:07,137 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 [1] [2022-12-13 11:32:09,233 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 [1] [2022-12-13 11:32:11,238 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 [1] [2022-12-13 11:32:13,247 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 [1] [2022-12-13 11:32:15,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:17,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:19,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:21,405 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 [1] [2022-12-13 11:32:24,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:27,727 INFO L130 PetriNetUnfolder]: 11920/20742 cut-off events. [2022-12-13 11:32:27,728 INFO L131 PetriNetUnfolder]: For 294460/294460 co-relation queries the response was YES. [2022-12-13 11:32:27,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127688 conditions, 20742 events. 11920/20742 cut-off events. For 294460/294460 co-relation queries the response was YES. Maximal size of possible extension queue 2535. Compared 185272 event pairs, 1135 based on Foata normal form. 434/9727 useless extension candidates. Maximal degree in co-relation 127639. Up to 12113 conditions per place. [2022-12-13 11:32:27,817 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 587 selfloop transitions, 598 changer transitions 3/1192 dead transitions. [2022-12-13 11:32:27,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1192 transitions, 18946 flow [2022-12-13 11:32:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:32:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 11:32:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 465 transitions. [2022-12-13 11:32:27,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48037190082644626 [2022-12-13 11:32:27,819 INFO L175 Difference]: Start difference. First operand has 136 places, 884 transitions, 13983 flow. Second operand 22 states and 465 transitions. [2022-12-13 11:32:27,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1192 transitions, 18946 flow [2022-12-13 11:32:32,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 1192 transitions, 17413 flow, removed 627 selfloop flow, removed 11 redundant places. [2022-12-13 11:32:32,162 INFO L231 Difference]: Finished difference. Result has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12678, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=464, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=16615, PETRI_PLACES=156, PETRI_TRANSITIONS=1031} [2022-12-13 11:32:32,162 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2022-12-13 11:32:32,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:32:32,163 INFO L89 Accepts]: Start accepts. Operand has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:32:32,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:32:32,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,838 INFO L130 PetriNetUnfolder]: 3193/6739 cut-off events. [2022-12-13 11:32:32,839 INFO L131 PetriNetUnfolder]: For 69577/69684 co-relation queries the response was YES. [2022-12-13 11:32:32,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49501 conditions, 6739 events. 3193/6739 cut-off events. For 69577/69684 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 64654 event pairs, 24 based on Foata normal form. 0/2114 useless extension candidates. Maximal degree in co-relation 49446. Up to 3630 conditions per place. [2022-12-13 11:32:32,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 9818 [2022-12-13 11:32:32,891 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:32:32,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 729 [2022-12-13 11:32:32,891 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 1031 transitions, 16615 flow [2022-12-13 11:32:32,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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 11:32:32,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:32:32,891 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:32:32,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 11:32:33,096 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,SelfDestructingSolverStorable17 [2022-12-13 11:32:33,096 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 11:32:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:32:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -281408299, now seen corresponding path program 1 times [2022-12-13 11:32:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:32:33,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845352154] [2022-12-13 11:32:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:32:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:32:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:32:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:32:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:32:33,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845352154] [2022-12-13 11:32:33,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845352154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:32:33,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146748150] [2022-12-13 11:32:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:32:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:32:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:32:33,212 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 11:32:33,214 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 11:32:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:32:33,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 11:32:33,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:32:33,380 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 11:32:33,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:32:33,635 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 11:32:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146748150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:32:33,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:32:33,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:32:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016646031] [2022-12-13 11:32:33,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:32:33,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:32:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:32:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:32:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:32:33,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 11:32:33,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1031 transitions, 16615 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:32:33,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:32:33,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 11:32:33,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:32:40,441 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 60 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:32:44,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:48,458 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 [1] [2022-12-13 11:32:50,467 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 [1] [2022-12-13 11:32:52,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:54,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:32:57,059 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 [1] [2022-12-13 11:32:59,251 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 [1] [2022-12-13 11:33:01,479 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 [1] [2022-12-13 11:33:06,314 INFO L130 PetriNetUnfolder]: 14174/24785 cut-off events. [2022-12-13 11:33:06,314 INFO L131 PetriNetUnfolder]: For 485750/485750 co-relation queries the response was YES. [2022-12-13 11:33:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158224 conditions, 24785 events. 14174/24785 cut-off events. For 485750/485750 co-relation queries the response was YES. Maximal size of possible extension queue 2965. Compared 228474 event pairs, 780 based on Foata normal form. 448/11451 useless extension candidates. Maximal degree in co-relation 158166. Up to 12672 conditions per place. [2022-12-13 11:33:06,451 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 591 selfloop transitions, 823 changer transitions 0/1418 dead transitions. [2022-12-13 11:33:06,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1418 transitions, 23458 flow [2022-12-13 11:33:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 11:33:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 11:33:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 500 transitions. [2022-12-13 11:33:06,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2022-12-13 11:33:06,453 INFO L175 Difference]: Start difference. First operand has 156 places, 1031 transitions, 16615 flow. Second operand 24 states and 500 transitions. [2022-12-13 11:33:06,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1418 transitions, 23458 flow [2022-12-13 11:33:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1418 transitions, 22429 flow, removed 417 selfloop flow, removed 7 redundant places. [2022-12-13 11:33:13,415 INFO L231 Difference]: Finished difference. Result has 182 places, 1249 transitions, 22052 flow [2022-12-13 11:33:13,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15650, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1031, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=629, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=22052, PETRI_PLACES=182, PETRI_TRANSITIONS=1249} [2022-12-13 11:33:13,416 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2022-12-13 11:33:13,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:33:13,416 INFO L89 Accepts]: Start accepts. Operand has 182 places, 1249 transitions, 22052 flow [2022-12-13 11:33:13,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:33:13,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:33:13,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 1249 transitions, 22052 flow [2022-12-13 11:33:13,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 1249 transitions, 22052 flow [2022-12-13 11:33:14,452 INFO L130 PetriNetUnfolder]: 3773/8051 cut-off events. [2022-12-13 11:33:14,452 INFO L131 PetriNetUnfolder]: For 115262/115360 co-relation queries the response was YES. [2022-12-13 11:33:14,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64805 conditions, 8051 events. 3773/8051 cut-off events. For 115262/115360 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 80622 event pairs, 8 based on Foata normal form. 0/2517 useless extension candidates. Maximal degree in co-relation 64739. Up to 4306 conditions per place. [2022-12-13 11:33:14,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 1249 transitions, 22052 flow [2022-12-13 11:33:14,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 11722 [2022-12-13 11:33:14,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:33:14,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 11:33:14,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 11:33:14,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:33:14,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:33:14,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:33:14,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 11:33:14,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:33:14,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:33:14,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1518 [2022-12-13 11:33:14,934 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1249 transitions, 22132 flow [2022-12-13 11:33:14,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:33:14,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:33:14,935 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:33:14,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 11:33:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:33:15,135 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 11:33:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:33:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -44763169, now seen corresponding path program 1 times [2022-12-13 11:33:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:33:15,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721522904] [2022-12-13 11:33:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:33:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:33:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:33:15,310 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 11:33:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:33:15,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721522904] [2022-12-13 11:33:15,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721522904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:33:15,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348787568] [2022-12-13 11:33:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:33:15,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:33:15,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:33:15,312 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 11:33:15,314 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 11:33:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:33:15,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:33:15,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:33:15,493 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 11:33:15,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:33:15,776 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 11:33:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348787568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:33:15,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:33:15,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:33:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557484603] [2022-12-13 11:33:15,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:33:15,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:33:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:33:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:33:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:33:15,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 52 [2022-12-13 11:33:15,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1249 transitions, 22132 flow. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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 11:33:15,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:33:15,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 52 [2022-12-13 11:33:15,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:33:23,620 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 [1] [2022-12-13 11:33:25,627 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 [1] [2022-12-13 11:33:27,660 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 [1] [2022-12-13 11:33:29,669 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 [1] [2022-12-13 11:33:31,682 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 [1] [2022-12-13 11:33:33,689 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 [1] [2022-12-13 11:33:35,699 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 [1] [2022-12-13 11:33:37,710 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 [1] [2022-12-13 11:33:40,483 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 [1] [2022-12-13 11:33:42,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:33:44,056 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 [1] [2022-12-13 11:33:49,525 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 [1] [2022-12-13 11:33:53,921 INFO L130 PetriNetUnfolder]: 15175/26666 cut-off events. [2022-12-13 11:33:53,921 INFO L131 PetriNetUnfolder]: For 728253/728253 co-relation queries the response was YES. [2022-12-13 11:33:54,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184634 conditions, 26666 events. 15175/26666 cut-off events. For 728253/728253 co-relation queries the response was YES. Maximal size of possible extension queue 3116. Compared 248199 event pairs, 2436 based on Foata normal form. 497/12196 useless extension candidates. Maximal degree in co-relation 184565. Up to 20161 conditions per place. [2022-12-13 11:33:54,170 INFO L137 encePairwiseOnDemand]: 16/52 looper letters, 1030 selfloop transitions, 486 changer transitions 1/1521 dead transitions. [2022-12-13 11:33:54,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 1521 transitions, 27664 flow [2022-12-13 11:33:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:33:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 11:33:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 443 transitions. [2022-12-13 11:33:54,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4056776556776557 [2022-12-13 11:33:54,172 INFO L175 Difference]: Start difference. First operand has 182 places, 1249 transitions, 22132 flow. Second operand 21 states and 443 transitions. [2022-12-13 11:33:54,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 1521 transitions, 27664 flow [2022-12-13 11:34:03,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1521 transitions, 26075 flow, removed 572 selfloop flow, removed 10 redundant places. [2022-12-13 11:34:03,944 INFO L231 Difference]: Finished difference. Result has 199 places, 1377 transitions, 24271 flow [2022-12-13 11:34:03,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=20609, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=24271, PETRI_PLACES=199, PETRI_TRANSITIONS=1377} [2022-12-13 11:34:03,945 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2022-12-13 11:34:03,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:34:03,946 INFO L89 Accepts]: Start accepts. Operand has 199 places, 1377 transitions, 24271 flow [2022-12-13 11:34:03,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:34:03,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:34:03,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 1377 transitions, 24271 flow [2022-12-13 11:34:03,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 1377 transitions, 24271 flow [2022-12-13 11:34:05,005 INFO L130 PetriNetUnfolder]: 4113/8763 cut-off events. [2022-12-13 11:34:05,005 INFO L131 PetriNetUnfolder]: For 150250/150339 co-relation queries the response was YES. [2022-12-13 11:34:05,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70636 conditions, 8763 events. 4113/8763 cut-off events. For 150250/150339 co-relation queries the response was YES. Maximal size of possible extension queue 1415. Compared 87311 event pairs, 20 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 70564. Up to 4834 conditions per place. [2022-12-13 11:34:05,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 1377 transitions, 24271 flow [2022-12-13 11:34:05,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 12922 [2022-12-13 11:34:05,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 11:34:05,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:05,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:34:05,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 11:34:05,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:34:05,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 11:34:05,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:05,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:05,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 11:34:05,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:05,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 11:34:05,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:05,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:34:05,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 11:34:05,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:34:06,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (and (< v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|) (< v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1) |v_ULTIMATE.start_main_~assert_cond~0#1_62|) (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 11:34:06,101 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:34:06,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2157 [2022-12-13 11:34:06,102 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 1377 transitions, 24967 flow [2022-12-13 11:34:06,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 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 11:34:06,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:34:06,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:34:06,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 11:34:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:34:06,306 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 11:34:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:34:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash -280635996, now seen corresponding path program 1 times [2022-12-13 11:34:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:34:06,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274062135] [2022-12-13 11:34:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:34:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:34:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:34:06,410 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 11:34:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:34:06,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274062135] [2022-12-13 11:34:06,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274062135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:34:06,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465607749] [2022-12-13 11:34:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:34:06,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:34:06,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:34:06,412 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 11:34:06,414 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 11:34:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:34:06,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 11:34:06,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:34:06,583 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 11:34:06,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:34:06,859 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 11:34:06,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465607749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:34:06,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:34:06,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:34:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250733438] [2022-12-13 11:34:06,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:34:06,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:34:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:34:06,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:34:06,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:34:06,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 68 [2022-12-13 11:34:06,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1377 transitions, 24967 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:34:06,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:34:06,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 68 [2022-12-13 11:34:06,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:34:14,806 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 63 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:34:17,478 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 [1] [2022-12-13 11:34:19,493 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 [1] [2022-12-13 11:34:20,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:34:22,807 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 [1] [2022-12-13 11:34:24,820 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 [1] [2022-12-13 11:34:26,830 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 [1] [2022-12-13 11:34:28,848 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 [1] [2022-12-13 11:34:30,862 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 [1] [2022-12-13 11:34:32,870 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 [1] [2022-12-13 11:34:34,881 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 [1] [2022-12-13 11:34:36,896 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 [1] [2022-12-13 11:34:38,903 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 [1] [2022-12-13 11:34:47,535 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 61 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:34:49,579 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 [1] [2022-12-13 11:34:51,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:34:57,311 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 [1] [2022-12-13 11:34:59,323 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 [1] [2022-12-13 11:35:01,338 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 [1] [2022-12-13 11:35:03,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:35:06,722 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 [1] [2022-12-13 11:35:08,737 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 [1] [2022-12-13 11:35:10,784 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 [1] [2022-12-13 11:35:12,792 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 [1] [2022-12-13 11:35:14,802 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 [1] [2022-12-13 11:35:19,080 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 [1] [2022-12-13 11:35:21,091 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 [1] [2022-12-13 11:35:29,474 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 [1] [2022-12-13 11:35:32,250 INFO L130 PetriNetUnfolder]: 16364/28922 cut-off events. [2022-12-13 11:35:32,251 INFO L131 PetriNetUnfolder]: For 761473/761473 co-relation queries the response was YES. [2022-12-13 11:35:32,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202381 conditions, 28922 events. 16364/28922 cut-off events. For 761473/761473 co-relation queries the response was YES. Maximal size of possible extension queue 3381. Compared 275735 event pairs, 2175 based on Foata normal form. 294/12778 useless extension candidates. Maximal degree in co-relation 202306. Up to 19265 conditions per place. [2022-12-13 11:35:32,422 INFO L137 encePairwiseOnDemand]: 16/68 looper letters, 915 selfloop transitions, 773 changer transitions 1/1693 dead transitions. [2022-12-13 11:35:32,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1693 transitions, 31513 flow [2022-12-13 11:35:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:35:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 11:35:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 495 transitions. [2022-12-13 11:35:32,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31649616368286443 [2022-12-13 11:35:32,424 INFO L175 Difference]: Start difference. First operand has 198 places, 1377 transitions, 24967 flow. Second operand 23 states and 495 transitions. [2022-12-13 11:35:32,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 1693 transitions, 31513 flow [2022-12-13 11:35:44,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1693 transitions, 29549 flow, removed 865 selfloop flow, removed 9 redundant places. [2022-12-13 11:35:44,981 INFO L231 Difference]: Finished difference. Result has 218 places, 1538 transitions, 28384 flow [2022-12-13 11:35:44,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=23067, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=659, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=28384, PETRI_PLACES=218, PETRI_TRANSITIONS=1538} [2022-12-13 11:35:44,982 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2022-12-13 11:35:44,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:35:44,982 INFO L89 Accepts]: Start accepts. Operand has 218 places, 1538 transitions, 28384 flow [2022-12-13 11:35:44,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:35:44,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:35:44,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 1538 transitions, 28384 flow [2022-12-13 11:35:44,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 1538 transitions, 28384 flow [2022-12-13 11:35:46,282 INFO L130 PetriNetUnfolder]: 4417/9583 cut-off events. [2022-12-13 11:35:46,283 INFO L131 PetriNetUnfolder]: For 185439/185537 co-relation queries the response was YES. [2022-12-13 11:35:46,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80808 conditions, 9583 events. 4417/9583 cut-off events. For 185439/185537 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 99853 event pairs, 20 based on Foata normal form. 0/2900 useless extension candidates. Maximal degree in co-relation 80729. Up to 5030 conditions per place. [2022-12-13 11:35:46,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 1538 transitions, 28384 flow [2022-12-13 11:35:46,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 14266 [2022-12-13 11:35:46,369 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:35:46,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1387 [2022-12-13 11:35:46,369 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 1538 transitions, 28384 flow [2022-12-13 11:35:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 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 11:35:46,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:35:46,369 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:35:46,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 11:35:46,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:35:46,574 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting L687-4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:35:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:35:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -110784794, now seen corresponding path program 1 times [2022-12-13 11:35:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:35:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605585135] [2022-12-13 11:35:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:35:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:35:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:35:46,719 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 11:35:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:35:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605585135] [2022-12-13 11:35:46,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605585135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:35:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303035374] [2022-12-13 11:35:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:35:46,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:35:46,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:35:46,731 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 11:35:46,732 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 11:35:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:35:46,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:35:46,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:35:46,917 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 11:35:46,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:35:47,292 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 11:35:47,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303035374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:35:47,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:35:47,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:35:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473375483] [2022-12-13 11:35:47,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:35:47,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:35:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:35:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:35:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:35:47,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 68 [2022-12-13 11:35:47,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1538 transitions, 28384 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:35:47,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:35:47,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 68 [2022-12-13 11:35:47,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:35:53,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:36:01,922 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 [1] [2022-12-13 11:36:04,224 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 [1] [2022-12-13 11:36:07,232 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 [1] [2022-12-13 11:36:09,244 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 [1] [2022-12-13 11:36:10,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:36:18,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:36:21,223 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 [1] [2022-12-13 11:36:24,585 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 [1] [2022-12-13 11:36:26,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:36:30,738 INFO L130 PetriNetUnfolder]: 16518/29340 cut-off events. [2022-12-13 11:36:30,738 INFO L131 PetriNetUnfolder]: For 949303/949303 co-relation queries the response was YES. [2022-12-13 11:36:30,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212708 conditions, 29340 events. 16518/29340 cut-off events. For 949303/949303 co-relation queries the response was YES. Maximal size of possible extension queue 3397. Compared 282505 event pairs, 2278 based on Foata normal form. 383/12943 useless extension candidates. Maximal degree in co-relation 212626. Up to 20588 conditions per place. [2022-12-13 11:36:30,946 INFO L137 encePairwiseOnDemand]: 16/68 looper letters, 1048 selfloop transitions, 683 changer transitions 0/1735 dead transitions. [2022-12-13 11:36:30,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1735 transitions, 33399 flow [2022-12-13 11:36:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:36:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 11:36:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 457 transitions. [2022-12-13 11:36:30,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32002801120448177 [2022-12-13 11:36:30,948 INFO L175 Difference]: Start difference. First operand has 217 places, 1538 transitions, 28384 flow. Second operand 21 states and 457 transitions. [2022-12-13 11:36:30,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 1735 transitions, 33399 flow [2022-12-13 11:36:46,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1735 transitions, 32531 flow, removed 261 selfloop flow, removed 12 redundant places. [2022-12-13 11:36:46,112 INFO L231 Difference]: Finished difference. Result has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:46,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=27129, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=619, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=30709, PETRI_PLACES=227, PETRI_TRANSITIONS=1593} [2022-12-13 11:36:46,113 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2022-12-13 11:36:46,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:36:46,113 INFO L89 Accepts]: Start accepts. Operand has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:46,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:36:46,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:36:46,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:46,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:47,573 INFO L130 PetriNetUnfolder]: 4493/9851 cut-off events. [2022-12-13 11:36:47,573 INFO L131 PetriNetUnfolder]: For 193634/193768 co-relation queries the response was YES. [2022-12-13 11:36:47,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86062 conditions, 9851 events. 4493/9851 cut-off events. For 193634/193768 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 103615 event pairs, 24 based on Foata normal form. 0/2964 useless extension candidates. Maximal degree in co-relation 85981. Up to 5202 conditions per place. [2022-12-13 11:36:47,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:47,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 14678 [2022-12-13 11:36:47,667 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:36:47,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1555 [2022-12-13 11:36:47,668 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 1593 transitions, 30709 flow [2022-12-13 11:36:47,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:36:47,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:36:47,668 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:36:47,674 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 11:36:47,868 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,SelfDestructingSolverStorable21 [2022-12-13 11:36:47,869 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 11:36:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:36:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 513158500, now seen corresponding path program 1 times [2022-12-13 11:36:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:36:47,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972627475] [2022-12-13 11:36:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:36:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:36:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:36:48,043 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 11:36:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:36:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972627475] [2022-12-13 11:36:48,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972627475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:36:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875510715] [2022-12-13 11:36:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:36:48,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:36:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:36:48,045 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 11:36:48,047 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 11:36:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:36:48,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:36:48,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:36:48,261 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 11:36:48,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:36:48,540 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 11:36:48,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875510715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:36:48,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:36:48,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:36:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641138803] [2022-12-13 11:36:48,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:36:48,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:36:48,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:36:48,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:36:48,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:36:48,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 60 [2022-12-13 11:36:48,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1593 transitions, 30709 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:36:48,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:36:48,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 60 [2022-12-13 11:36:48,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:36:57,493 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 [1] [2022-12-13 11:36:59,498 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 [1] [2022-12-13 11:37:01,661 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 [1] [2022-12-13 11:37:05,206 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 [1] [2022-12-13 11:37:07,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 [1] [2022-12-13 11:37:09,547 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 [1] [2022-12-13 11:37:11,556 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 [1] [2022-12-13 11:37:17,758 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 [1] [2022-12-13 11:37:19,900 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 [1] [2022-12-13 11:37:22,982 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 [1] [2022-12-13 11:37:25,096 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 [1] [2022-12-13 11:37:27,112 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 [1] [2022-12-13 11:37:29,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:37:31,149 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 [1] [2022-12-13 11:37:33,469 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 [1] [2022-12-13 11:37:35,482 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 [1] [2022-12-13 11:37:37,894 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 [1] [2022-12-13 11:37:39,907 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 [1] [2022-12-13 11:37:41,970 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 [1] [2022-12-13 11:37:44,034 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 [1] [2022-12-13 11:37:46,487 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 [1] [2022-12-13 11:37:48,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:37:50,212 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 [1] [2022-12-13 11:37:52,224 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 [1] [2022-12-13 11:37:54,234 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 [1] [2022-12-13 11:38:01,659 INFO L130 PetriNetUnfolder]: 17967/32347 cut-off events. [2022-12-13 11:38:01,659 INFO L131 PetriNetUnfolder]: For 993140/993140 co-relation queries the response was YES. [2022-12-13 11:38:01,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241537 conditions, 32347 events. 17967/32347 cut-off events. For 993140/993140 co-relation queries the response was YES. Maximal size of possible extension queue 3631. Compared 318182 event pairs, 2605 based on Foata normal form. 294/13941 useless extension candidates. Maximal degree in co-relation 241453. Up to 23009 conditions per place. [2022-12-13 11:38:01,946 INFO L137 encePairwiseOnDemand]: 24/60 looper letters, 1262 selfloop transitions, 692 changer transitions 15/1973 dead transitions. [2022-12-13 11:38:01,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1973 transitions, 39311 flow [2022-12-13 11:38:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:38:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 11:38:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 532 transitions. [2022-12-13 11:38:01,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32839506172839505 [2022-12-13 11:38:01,948 INFO L175 Difference]: Start difference. First operand has 227 places, 1593 transitions, 30709 flow. Second operand 27 states and 532 transitions. [2022-12-13 11:38:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 1973 transitions, 39311 flow [2022-12-13 11:38:21,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1973 transitions, 37825 flow, removed 522 selfloop flow, removed 11 redundant places. [2022-12-13 11:38:21,281 INFO L231 Difference]: Finished difference. Result has 248 places, 1796 transitions, 35838 flow [2022-12-13 11:38:21,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=29389, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=35838, PETRI_PLACES=248, PETRI_TRANSITIONS=1796} [2022-12-13 11:38:21,283 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 216 predicate places. [2022-12-13 11:38:21,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:38:21,283 INFO L89 Accepts]: Start accepts. Operand has 248 places, 1796 transitions, 35838 flow [2022-12-13 11:38:21,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:38:21,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:38:21,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 1796 transitions, 35838 flow [2022-12-13 11:38:21,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 1796 transitions, 35838 flow [2022-12-13 11:38:23,030 INFO L130 PetriNetUnfolder]: 4954/11071 cut-off events. [2022-12-13 11:38:23,031 INFO L131 PetriNetUnfolder]: For 255001/255126 co-relation queries the response was YES. [2022-12-13 11:38:23,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99838 conditions, 11071 events. 4954/11071 cut-off events. For 255001/255126 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 119135 event pairs, 24 based on Foata normal form. 0/3284 useless extension candidates. Maximal degree in co-relation 99751. Up to 5674 conditions per place. [2022-12-13 11:38:23,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 1796 transitions, 35838 flow [2022-12-13 11:38:23,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 16358 [2022-12-13 11:38:23,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L705-6-->L695-4: Formula: (and (= v_~j~0_157 (+ v_~j~0_158 v_~i~0_163)) (= v_~next~0_117 v_~cur~0_192) (< v_~x~0_207 17) (= v_~x~0_207 (+ 16 v_~x~0_208)) (= (+ |v_t2Thread1of1ForFork0_#t~post2_36| 1) v_~q~0_63) (= v_~q~0_64 |v_t2Thread1of1ForFork0_#t~post2_36|) (= (* 610 v_~next~0_117) (+ (* v_~prev~0_219 987) v_~cur~0_193)) (= (* 610 v_~prev~0_219) (+ v_~prev~0_220 v_~cur~0_193 (* 377 v_~next~0_117))) (< v_~q~0_64 7)) InVars {~j~0=v_~j~0_158, ~prev~0=v_~prev~0_220, ~i~0=v_~i~0_163, ~q~0=v_~q~0_64, ~cur~0=v_~cur~0_193, ~x~0=v_~x~0_208} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_123|, ~j~0=v_~j~0_157, ~next~0=v_~next~0_117, ~prev~0=v_~prev~0_219, ~i~0=v_~i~0_163, ~q~0=v_~q~0_63, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_36|, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_207} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:38:23,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [367] L705-6-->L695-3: Formula: (and (= (+ 16 v_~x~0_212) v_~x~0_211) (< v_~x~0_211 17) (= v_~q~0_67 |v_t2Thread1of1ForFork0_#t~post2_38|) (= v_~next~0_119 v_~cur~0_196) (= (* 610 v_~next~0_119) (+ (* v_~prev~0_223 987) v_~cur~0_197)) (< v_~q~0_67 7) (= v_~j~0_161 (+ v_~j~0_162 v_~i~0_165)) (= (* 610 v_~prev~0_223) (+ (* 377 v_~next~0_119) v_~prev~0_224 v_~cur~0_197))) InVars {~j~0=v_~j~0_162, ~prev~0=v_~prev~0_224, ~i~0=v_~i~0_165, ~q~0=v_~q~0_67, ~cur~0=v_~cur~0_197, ~x~0=v_~x~0_212} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_125|, ~j~0=v_~j~0_161, ~next~0=v_~next~0_119, ~prev~0=v_~prev~0_223, ~i~0=v_~i~0_165, ~q~0=v_~q~0_67, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_196, ~x~0=v_~x~0_211} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:38:23,469 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:38:23,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2187 [2022-12-13 11:38:23,470 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1793 transitions, 35797 flow [2022-12-13 11:38:23,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:38:23,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:38:23,470 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:38:23,475 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 11:38:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 11:38:23,675 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 11:38:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:38:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -666528055, now seen corresponding path program 1 times [2022-12-13 11:38:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:38:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053963705] [2022-12-13 11:38:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:38:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:38:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:38:23,842 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 11:38:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:38:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053963705] [2022-12-13 11:38:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053963705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:38:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193328310] [2022-12-13 11:38:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:38:23,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:38:23,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:38:23,844 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 11:38:23,846 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 11:38:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:38:23,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 11:38:23,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:38:24,048 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 11:38:24,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:38:24,439 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 11:38:24,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193328310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:38:24,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:38:24,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:38:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16639583] [2022-12-13 11:38:24,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:38:24,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:38:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:38:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:38:24,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:38:24,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-13 11:38:24,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1793 transitions, 35797 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:38:24,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:38:24,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-13 11:38:24,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:38:27,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:38:31,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:38:42,624 INFO L130 PetriNetUnfolder]: 22185/39709 cut-off events. [2022-12-13 11:38:42,624 INFO L131 PetriNetUnfolder]: For 1322432/1322432 co-relation queries the response was YES. [2022-12-13 11:38:42,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306403 conditions, 39709 events. 22185/39709 cut-off events. For 1322432/1322432 co-relation queries the response was YES. Maximal size of possible extension queue 4653. Compared 399256 event pairs, 712 based on Foata normal form. 301/17353 useless extension candidates. Maximal degree in co-relation 306313. Up to 14511 conditions per place. [2022-12-13 11:38:43,064 INFO L137 encePairwiseOnDemand]: 16/62 looper letters, 745 selfloop transitions, 1568 changer transitions 9/2326 dead transitions. [2022-12-13 11:38:43,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 2326 transitions, 49139 flow [2022-12-13 11:38:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:38:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 11:38:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 421 transitions. [2022-12-13 11:38:43,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3772401433691756 [2022-12-13 11:38:43,065 INFO L175 Difference]: Start difference. First operand has 245 places, 1793 transitions, 35797 flow. Second operand 18 states and 421 transitions. [2022-12-13 11:38:43,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 2326 transitions, 49139 flow [2022-12-13 11:39:08,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 2326 transitions, 47615 flow, removed 515 selfloop flow, removed 8 redundant places. [2022-12-13 11:39:08,379 INFO L231 Difference]: Finished difference. Result has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:08,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=34401, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=47509, PETRI_PLACES=260, PETRI_TRANSITIONS=2170} [2022-12-13 11:39:08,380 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 228 predicate places. [2022-12-13 11:39:08,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:39:08,381 INFO L89 Accepts]: Start accepts. Operand has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:08,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:39:08,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:39:08,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:08,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:10,945 INFO L130 PetriNetUnfolder]: 5965/13326 cut-off events. [2022-12-13 11:39:10,945 INFO L131 PetriNetUnfolder]: For 322893/323067 co-relation queries the response was YES. [2022-12-13 11:39:11,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131750 conditions, 13326 events. 5965/13326 cut-off events. For 322893/323067 co-relation queries the response was YES. Maximal size of possible extension queue 2222. Compared 147856 event pairs, 44 based on Foata normal form. 0/4016 useless extension candidates. Maximal degree in co-relation 131656. Up to 6831 conditions per place. [2022-12-13 11:39:11,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:11,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 19736 [2022-12-13 11:39:11,111 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:39:11,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2735 [2022-12-13 11:39:11,115 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 2170 transitions, 47509 flow [2022-12-13 11:39:11,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:39:11,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:39:11,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:39:11,122 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 11:39:11,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:39:11,321 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 11:39:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:39:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1932394235, now seen corresponding path program 1 times [2022-12-13 11:39:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:39:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272696097] [2022-12-13 11:39:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:39:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:39:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:39:11,426 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 11:39:11,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:39:11,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272696097] [2022-12-13 11:39:11,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272696097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:39:11,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430970079] [2022-12-13 11:39:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:39:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:39:11,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:39:11,428 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 11:39:11,428 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 11:39:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:39:11,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 11:39:11,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:39:11,584 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 11:39:11,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:39:11,758 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 11:39:11,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430970079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:39:11,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:39:11,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 11:39:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70537094] [2022-12-13 11:39:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:39:11,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:39:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:39:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:39:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:39:11,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-13 11:39:11,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 2170 transitions, 47509 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:39:11,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:39:11,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-13 11:39:11,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:39:14,529 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 [1] [2022-12-13 11:39:16,756 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 [1] [2022-12-13 11:39:18,960 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 [1] [2022-12-13 11:39:21,001 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 [1] [2022-12-13 11:39:23,021 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 [1] [2022-12-13 11:39:25,041 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 [1] [2022-12-13 11:39:27,269 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 [1] [2022-12-13 11:39:41,113 INFO L130 PetriNetUnfolder]: 22872/41137 cut-off events. [2022-12-13 11:39:41,113 INFO L131 PetriNetUnfolder]: For 1028711/1028711 co-relation queries the response was YES. [2022-12-13 11:39:41,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339951 conditions, 41137 events. 22872/41137 cut-off events. For 1028711/1028711 co-relation queries the response was YES. Maximal size of possible extension queue 4881. Compared 420486 event pairs, 5199 based on Foata normal form. 21/17531 useless extension candidates. Maximal degree in co-relation 339854. Up to 35765 conditions per place. [2022-12-13 11:39:41,469 INFO L137 encePairwiseOnDemand]: 33/62 looper letters, 1981 selfloop transitions, 392 changer transitions 9/2386 dead transitions. [2022-12-13 11:39:41,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 2386 transitions, 55441 flow [2022-12-13 11:39:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:39:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 11:39:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 304 transitions. [2022-12-13 11:39:41,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35023041474654376 [2022-12-13 11:39:41,470 INFO L175 Difference]: Start difference. First operand has 260 places, 2170 transitions, 47509 flow. Second operand 14 states and 304 transitions. [2022-12-13 11:39:41,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 2386 transitions, 55441 flow [2022-12-13 11:40:17,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 2386 transitions, 53041 flow, removed 959 selfloop flow, removed 12 redundant places. [2022-12-13 11:40:17,284 INFO L231 Difference]: Finished difference. Result has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:17,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=45309, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=49337, PETRI_PLACES=265, PETRI_TRANSITIONS=2285} [2022-12-13 11:40:17,285 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 233 predicate places. [2022-12-13 11:40:17,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:40:17,286 INFO L89 Accepts]: Start accepts. Operand has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:17,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:40:17,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:40:17,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:17,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:19,992 INFO L130 PetriNetUnfolder]: 6189/14001 cut-off events. [2022-12-13 11:40:19,992 INFO L131 PetriNetUnfolder]: For 319430/319613 co-relation queries the response was YES. [2022-12-13 11:40:20,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133956 conditions, 14001 events. 6189/14001 cut-off events. For 319430/319613 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 158222 event pairs, 44 based on Foata normal form. 0/4187 useless extension candidates. Maximal degree in co-relation 133862. Up to 7142 conditions per place. [2022-12-13 11:40:20,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:20,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 20648 [2022-12-13 11:40:20,150 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:40:20,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2865 [2022-12-13 11:40:20,150 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 2285 transitions, 49337 flow [2022-12-13 11:40:20,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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 11:40:20,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:40:20,151 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:40:20,156 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 11:40:20,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:40:20,357 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 11:40:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:40:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 547944406, now seen corresponding path program 1 times [2022-12-13 11:40:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:40:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958093370] [2022-12-13 11:40:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:40:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:40:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:40:20,484 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 11:40:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:40:20,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958093370] [2022-12-13 11:40:20,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958093370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:40:20,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181966414] [2022-12-13 11:40:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:40:20,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:40:20,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:40:20,486 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 11:40:20,488 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 11:40:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:40:20,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 11:40:20,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:40:20,700 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 11:40:20,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:40:20,956 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 11:40:20,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181966414] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:40:20,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:40:20,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:40:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659185879] [2022-12-13 11:40:20,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:40:20,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:40:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:40:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:40:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:40:20,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-13 11:40:20,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 2285 transitions, 49337 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:40:20,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:40:20,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-13 11:40:20,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:40:29,712 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 62 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:40:32,252 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 [1] [2022-12-13 11:40:34,293 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 [1] [2022-12-13 11:40:35,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:40:37,458 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 [1] [2022-12-13 11:40:39,481 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 [1] [2022-12-13 11:40:48,346 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 [1] [2022-12-13 11:40:54,900 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 [1] [2022-12-13 11:41:02,719 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 55 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:41:11,914 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 [1] [2022-12-13 11:41:13,940 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 [1] [2022-12-13 11:41:18,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:41:20,854 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 [1] [2022-12-13 11:41:34,624 INFO L130 PetriNetUnfolder]: 24230/43889 cut-off events. [2022-12-13 11:41:34,625 INFO L131 PetriNetUnfolder]: For 1614786/1614786 co-relation queries the response was YES. [2022-12-13 11:41:34,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352762 conditions, 43889 events. 24230/43889 cut-off events. For 1614786/1614786 co-relation queries the response was YES. Maximal size of possible extension queue 5336. Compared 456500 event pairs, 4098 based on Foata normal form. 420/18831 useless extension candidates. Maximal degree in co-relation 352665. Up to 33789 conditions per place. [2022-12-13 11:41:35,015 INFO L137 encePairwiseOnDemand]: 24/62 looper letters, 1891 selfloop transitions, 752 changer transitions 27/2674 dead transitions. [2022-12-13 11:41:35,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 2674 transitions, 60047 flow [2022-12-13 11:41:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:41:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 11:41:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 511 transitions. [2022-12-13 11:41:35,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3052568697729988 [2022-12-13 11:41:35,017 INFO L175 Difference]: Start difference. First operand has 265 places, 2285 transitions, 49337 flow. Second operand 27 states and 511 transitions. [2022-12-13 11:41:35,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 2674 transitions, 60047 flow [2022-12-13 11:42:11,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 2674 transitions, 59696 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 11:42:11,773 INFO L231 Difference]: Finished difference. Result has 289 places, 2497 transitions, 56424 flow [2022-12-13 11:42:11,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=48990, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=551, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=56424, PETRI_PLACES=289, PETRI_TRANSITIONS=2497} [2022-12-13 11:42:11,774 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 257 predicate places. [2022-12-13 11:42:11,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:11,774 INFO L89 Accepts]: Start accepts. Operand has 289 places, 2497 transitions, 56424 flow [2022-12-13 11:42:11,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:11,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:11,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 2497 transitions, 56424 flow [2022-12-13 11:42:11,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 2497 transitions, 56424 flow [2022-12-13 11:42:15,028 INFO L130 PetriNetUnfolder]: 6644/15232 cut-off events. [2022-12-13 11:42:15,028 INFO L131 PetriNetUnfolder]: For 380058/380232 co-relation queries the response was YES. [2022-12-13 11:42:15,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150243 conditions, 15232 events. 6644/15232 cut-off events. For 380058/380232 co-relation queries the response was YES. Maximal size of possible extension queue 2624. Compared 177090 event pairs, 44 based on Foata normal form. 0/4515 useless extension candidates. Maximal degree in co-relation 150144. Up to 7903 conditions per place. [2022-12-13 11:42:15,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 2497 transitions, 56424 flow [2022-12-13 11:42:15,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 22456 [2022-12-13 11:42:15,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:42:15,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 11:42:16,379 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:42:16,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4606 [2022-12-13 11:42:16,380 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 2492 transitions, 56367 flow [2022-12-13 11:42:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:42:16,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:16,380 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:16,384 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 11:42:16,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 11:42:16,581 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 11:42:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash -92135038, now seen corresponding path program 1 times [2022-12-13 11:42:16,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:16,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223615039] [2022-12-13 11:42:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:16,705 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 11:42:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:16,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223615039] [2022-12-13 11:42:16,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223615039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:42:16,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739591428] [2022-12-13 11:42:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:16,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:42:16,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:42:16,707 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 11:42:16,709 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 11:42:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:16,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 11:42:16,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:42:16,912 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 11:42:16,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:42:17,346 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 11:42:17,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739591428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:42:17,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:42:17,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 11:42:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632014519] [2022-12-13 11:42:17,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:42:17,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:42:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:42:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:42:17,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 68 [2022-12-13 11:42:17,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 2492 transitions, 56367 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 11:42:17,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:17,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 68 [2022-12-13 11:42:17,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:28,412 WARN L233 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:42:34,732 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 72 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-13 11:42:40,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:42:40,263 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 11:42:40,437 WARN L249 SmtUtils]: Removed 5 from assertion stack [2022-12-13 11:42:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:42:40,438 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 11:42:40,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 11:42:40,638 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,SelfDestructingSolverStorable26 [2022-12-13 11:42:40,639 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59 for 1530ms.. [2022-12-13 11:42:40,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 11:42:40,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 11:42:40,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:40,642 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:42:40,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:42:40,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:42:40 BasicIcfg [2022-12-13 11:42:40,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:42:40,644 INFO L158 Benchmark]: Toolchain (without parser) took 861194.46ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 162.9MB in the beginning and 1.0GB in the end (delta: -878.2MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-13 11:42:40,644 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 165.9MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:42:40,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.29ms. Allocated memory is still 189.8MB. Free memory was 162.9MB in the beginning and 142.6MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 11:42:40,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.09ms. Allocated memory is still 189.8MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:42:40,645 INFO L158 Benchmark]: Boogie Preprocessor took 15.64ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:42:40,645 INFO L158 Benchmark]: RCFGBuilder took 278.90ms. Allocated memory is still 189.8MB. Free memory was 138.9MB in the beginning and 125.3MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 11:42:40,645 INFO L158 Benchmark]: TraceAbstraction took 860489.21ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 123.7MB in the beginning and 1.0GB in the end (delta: -917.3MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-13 11:42:40,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 165.9MB in the end (delta: 88.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.29ms. Allocated memory is still 189.8MB. Free memory was 162.9MB in the beginning and 142.6MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.09ms. Allocated memory is still 189.8MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.64ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.90ms. Allocated memory is still 189.8MB. Free memory was 138.9MB in the beginning and 125.3MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 860489.21ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 123.7MB in the beginning and 1.0GB in the end (delta: -917.3MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 91 PlacesBefore, 32 PlacesAfterwards, 91 TransitionsBefore, 28 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 6 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 1655, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1670, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1406, unknown conditional: 0, unknown unconditional: 1406] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2625, Positive conditional cache size: 0, Positive unconditional cache size: 2625, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 32 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 120, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 300, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 420, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 560, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 720, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 800, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 41 PlacesBefore, 40 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 216, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 864, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 904 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): 864, Positive cache size: 864, Positive conditional cache size: 864, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 1940 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): 864, Positive cache size: 864, Positive conditional cache size: 864, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 1632 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): 864, Positive cache size: 864, Positive conditional cache size: 864, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 2488 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): 864, Positive cache size: 864, Positive conditional cache size: 864, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 302 TransitionsBefore, 302 TransitionsAfterwards, 3424 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 90 PlacesBefore, 88 PlacesAfterwards, 360 TransitionsBefore, 358 TransitionsAfterwards, 3840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 4, independent: 0, independent conditional: 0, 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): 952, Positive cache size: 952, Positive conditional cache size: 952, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 479 TransitionsBefore, 479 TransitionsAfterwards, 4824 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): 952, Positive cache size: 952, Positive conditional cache size: 952, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 620 TransitionsBefore, 620 TransitionsAfterwards, 6182 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): 952, Positive cache size: 952, Positive conditional cache size: 952, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 884 TransitionsBefore, 884 TransitionsAfterwards, 8566 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): 952, Positive cache size: 952, Positive conditional cache size: 952, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 1031 TransitionsBefore, 1031 TransitionsAfterwards, 9818 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): 952, Positive cache size: 952, Positive conditional cache size: 952, 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.4s, 182 PlacesBefore, 182 PlacesAfterwards, 1249 TransitionsBefore, 1249 TransitionsAfterwards, 11722 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 70, independent conditional: 70, 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): 962, Positive cache size: 962, Positive conditional cache size: 962, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 198 PlacesBefore, 198 PlacesAfterwards, 1377 TransitionsBefore, 1377 TransitionsAfterwards, 12922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 980, Positive conditional cache size: 980, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 1538 TransitionsBefore, 1538 TransitionsAfterwards, 14266 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): 980, Positive cache size: 980, Positive conditional cache size: 980, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 227 PlacesBefore, 227 PlacesAfterwards, 1593 TransitionsBefore, 1593 TransitionsAfterwards, 14678 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): 980, Positive cache size: 980, Positive conditional cache size: 980, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 248 PlacesBefore, 245 PlacesAfterwards, 1796 TransitionsBefore, 1793 TransitionsAfterwards, 16358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 0, independent conditional: 0, 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): 1072, Positive cache size: 1072, Positive conditional cache size: 1072, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 260 PlacesBefore, 260 PlacesAfterwards, 2170 TransitionsBefore, 2170 TransitionsAfterwards, 19736 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): 1072, Positive cache size: 1072, Positive conditional cache size: 1072, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 265 PlacesBefore, 265 PlacesAfterwards, 2285 TransitionsBefore, 2285 TransitionsAfterwards, 20648 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): 1072, Positive cache size: 1072, Positive conditional cache size: 1072, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 289 PlacesBefore, 284 PlacesAfterwards, 2497 TransitionsBefore, 2492 TransitionsAfterwards, 22456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 12, independent conditional: 12, 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): 1432, Positive cache size: 1432, Positive conditional cache size: 1432, 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: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59 for 1530ms.. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59 for 1530ms.. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59 for 1530ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 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: 860.4s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 817.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 139 mSolverCounterUnknown, 5263 SdHoareTripleChecker+Valid, 416.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5263 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 413.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5012 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14926 IncrementalHoareTripleChecker+Invalid, 20077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5012 mSolverCounterUnsat, 0 mSDtfsCounter, 14926 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 154.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56424occurred in iteration=26, InterpolantAutomatonStates: 355, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 693 ConstructedInterpolants, 146 QuantifiedInterpolants, 14707 SizeOfPredicates, 18 NumberOfNonLiveVariables, 3791 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 76 InterpolantComputations, 3 PerfectInterpolantSequences, 6/202 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