/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:19:42,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:19:42,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:19:42,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:19:42,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:19:42,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:19:42,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:19:42,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:19:42,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:19:42,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:19:42,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:19:42,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:19:42,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:19:42,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:19:42,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:19:42,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:19:42,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:19:42,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:19:42,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:19:42,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:19:42,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:19:42,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:19:42,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:19:42,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:19:42,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:19:42,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:19:42,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:19:42,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:19:42,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:19:42,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:19:42,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:19:42,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:19:42,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:19:42,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:19:42,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:19:42,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:19:42,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:19:42,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:19:42,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:19:42,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:19:42,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:19:42,100 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 08:19:42,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:19:42,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:19:42,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:19:42,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:19:42,128 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:19:42,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:19:42,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:19:42,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:19:42,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:19:42,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:19:42,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:19:42,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:19:42,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:19:42,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:19:42,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:19:42,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:19:42,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:19:42,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:19:42,415 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:19:42,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2022-12-13 08:19:43,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:19:43,611 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:19:43,612 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2022-12-13 08:19:43,620 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507414c09/39ad8910f108459a818c580abc1a94c9/FLAGeab0c6569 [2022-12-13 08:19:43,640 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507414c09/39ad8910f108459a818c580abc1a94c9 [2022-12-13 08:19:43,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:19:43,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:19:43,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:19:43,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:19:43,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:19:43,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:43,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22beab44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43, skipping insertion in model container [2022-12-13 08:19:43,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:43,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:19:43,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:19:43,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,847 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-12-13 08:19:43,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:19:43,874 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:19:43,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:19:43,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:19:43,914 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c[4380,4393] [2022-12-13 08:19:43,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:19:43,938 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:19:43,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43 WrapperNode [2022-12-13 08:19:43,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:19:43,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:19:43,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:19:43,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:19:43,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:43,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,000 INFO L138 Inliner]: procedures = 28, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 393 [2022-12-13 08:19:44,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:19:44,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:19:44,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:19:44,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:19:44,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,042 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:19:44,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:19:44,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:19:44,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:19:44,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (1/1) ... [2022-12-13 08:19:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:19:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:19:44,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:19:44,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:19:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:19:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 08:19:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:19:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:19:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 08:19:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 08:19:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 08:19:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 08:19:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:19:44,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:19:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:19:44,117 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:19:44,222 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:19:44,223 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:19:44,711 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:19:44,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:19:44,795 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-13 08:19:44,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:19:44 BoogieIcfgContainer [2022-12-13 08:19:44,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:19:44,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:19:44,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:19:44,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:19:44,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:19:43" (1/3) ... [2022-12-13 08:19:44,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5b5827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:19:44, skipping insertion in model container [2022-12-13 08:19:44,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:19:43" (2/3) ... [2022-12-13 08:19:44,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5b5827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:19:44, skipping insertion in model container [2022-12-13 08:19:44,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:19:44" (3/3) ... [2022-12-13 08:19:44,804 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2022-12-13 08:19:44,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:19:44,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:19:44,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:19:44,917 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 08:19:44,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 374 transitions, 772 flow [2022-12-13 08:19:45,077 INFO L130 PetriNetUnfolder]: 37/371 cut-off events. [2022-12-13 08:19:45,077 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:19:45,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 371 events. 37/371 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 400 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 292. Up to 2 conditions per place. [2022-12-13 08:19:45,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 374 transitions, 772 flow [2022-12-13 08:19:45,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 334 places, 361 transitions, 740 flow [2022-12-13 08:19:45,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:19:45,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 361 transitions, 740 flow [2022-12-13 08:19:45,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 361 transitions, 740 flow [2022-12-13 08:19:45,169 INFO L130 PetriNetUnfolder]: 37/361 cut-off events. [2022-12-13 08:19:45,169 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:19:45,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 361 events. 37/361 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 377 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 292. Up to 2 conditions per place. [2022-12-13 08:19:45,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 361 transitions, 740 flow [2022-12-13 08:19:45,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 4578 [2022-12-13 08:19:57,085 INFO L241 LiptonReduction]: Total number of compositions: 327 [2022-12-13 08:19:57,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:19:57,108 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;@e60096f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:19:57,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 08:19:57,115 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-12-13 08:19:57,115 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:19:57,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:19:57,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:19:57,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:19:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:19:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1167228973, now seen corresponding path program 1 times [2022-12-13 08:19:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:19:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506466158] [2022-12-13 08:19:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:19:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:19:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:19:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:19:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:19:57,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506466158] [2022-12-13 08:19:57,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506466158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:19:57,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:19:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:19:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236331887] [2022-12-13 08:19:57,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:19:57,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:19:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:19:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:19:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:19:57,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-13 08:19:57,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:19:57,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:19:57,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-13 08:19:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:19:57,681 INFO L130 PetriNetUnfolder]: 251/392 cut-off events. [2022-12-13 08:19:57,681 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 08:19:57,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 392 events. 251/392 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1425 event pairs, 67 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 656. Up to 227 conditions per place. [2022-12-13 08:19:57,686 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 43 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-13 08:19:57,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:19:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:19:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 08:19:57,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 08:19:57,697 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 08:19:57,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:19:57,702 INFO L89 Accepts]: Start accepts. Operand has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:19:57,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:19:57,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 08:19:57,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:19:57,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 08:19:57,721 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 208 flow [2022-12-13 08:19:57,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:19:57,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:19:57,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:19:57,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:19:57,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:19:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:19:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1822223421, now seen corresponding path program 1 times [2022-12-13 08:19:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:19:57,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380961275] [2022-12-13 08:19:57,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:19:57,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:19:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:19:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:19:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:19:57,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380961275] [2022-12-13 08:19:57,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380961275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:19:57,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:19:57,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:19:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277924033] [2022-12-13 08:19:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:19:57,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:19:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:19:57,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:19:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:19:57,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:19:57,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:19:57,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:19:57,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:19:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:19:57,986 INFO L130 PetriNetUnfolder]: 302/494 cut-off events. [2022-12-13 08:19:57,986 INFO L131 PetriNetUnfolder]: For 48/58 co-relation queries the response was YES. [2022-12-13 08:19:57,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 494 events. 302/494 cut-off events. For 48/58 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1916 event pairs, 108 based on Foata normal form. 22/398 useless extension candidates. Maximal degree in co-relation 962. Up to 385 conditions per place. [2022-12-13 08:19:57,988 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 46 selfloop transitions, 2 changer transitions 16/66 dead transitions. [2022-12-13 08:19:57,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 427 flow [2022-12-13 08:19:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:19:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:19:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 08:19:57,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-13 08:19:57,990 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 08:19:57,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 66 transitions, 427 flow [2022-12-13 08:19:57,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 50 transitions, 316 flow [2022-12-13 08:19:57,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:19:57,994 INFO L89 Accepts]: Start accepts. Operand has 40 places, 50 transitions, 316 flow [2022-12-13 08:19:57,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:19:57,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:19:57,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 50 transitions, 316 flow [2022-12-13 08:19:57,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 50 transitions, 316 flow [2022-12-13 08:19:57,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 08:19:57,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:19:57,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:19:57,999 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 50 transitions, 316 flow [2022-12-13 08:19:57,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:19:57,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:19:58,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:19:58,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:19:58,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:19:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:19:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2049710355, now seen corresponding path program 1 times [2022-12-13 08:19:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:19:58,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142871167] [2022-12-13 08:19:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:19:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:19:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:19:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:19:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:19:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142871167] [2022-12-13 08:19:58,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142871167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:19:58,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:19:58,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:19:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804820797] [2022-12-13 08:19:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:19:58,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:19:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:19:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:19:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:19:58,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:19:58,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 50 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:19:58,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:19:58,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:19:58,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:19:58,429 INFO L130 PetriNetUnfolder]: 324/559 cut-off events. [2022-12-13 08:19:58,429 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 08:19:58,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 559 events. 324/559 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2402 event pairs, 125 based on Foata normal form. 40/463 useless extension candidates. Maximal degree in co-relation 1270. Up to 537 conditions per place. [2022-12-13 08:19:58,433 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 47 selfloop transitions, 2 changer transitions 53/104 dead transitions. [2022-12-13 08:19:58,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 104 transitions, 874 flow [2022-12-13 08:19:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:19:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:19:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 08:19:58,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-13 08:19:58,438 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 08:19:58,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 104 transitions, 874 flow [2022-12-13 08:19:58,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 51 transitions, 420 flow [2022-12-13 08:19:58,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:19:58,444 INFO L89 Accepts]: Start accepts. Operand has 42 places, 51 transitions, 420 flow [2022-12-13 08:19:58,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:19:58,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:19:58,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 51 transitions, 420 flow [2022-12-13 08:19:58,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 51 transitions, 420 flow [2022-12-13 08:19:58,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 08:19:58,496 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:19:58,497 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:19:58,501 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:19:58,501 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:00,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:20:00,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2286 [2022-12-13 08:20:00,730 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 50 transitions, 412 flow [2022-12-13 08:20:00,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:00,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:00,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:00,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:20:00,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash 815792672, now seen corresponding path program 1 times [2022-12-13 08:20:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:00,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360201668] [2022-12-13 08:20:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:20:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:00,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360201668] [2022-12-13 08:20:00,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360201668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:00,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:00,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:20:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832151709] [2022-12-13 08:20:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:20:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:20:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:20:00,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:20:00,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 50 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:00,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:00,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:20:00,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:01,041 INFO L130 PetriNetUnfolder]: 357/605 cut-off events. [2022-12-13 08:20:01,041 INFO L131 PetriNetUnfolder]: For 122/152 co-relation queries the response was YES. [2022-12-13 08:20:01,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 605 events. 357/605 cut-off events. For 122/152 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2605 event pairs, 149 based on Foata normal form. 44/516 useless extension candidates. Maximal degree in co-relation 1578. Up to 594 conditions per place. [2022-12-13 08:20:01,045 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 46 selfloop transitions, 4 changer transitions 40/92 dead transitions. [2022-12-13 08:20:01,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 92 transitions, 958 flow [2022-12-13 08:20:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:20:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:20:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 08:20:01,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2022-12-13 08:20:01,049 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 08:20:01,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 92 transitions, 958 flow [2022-12-13 08:20:01,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 52 transitions, 528 flow [2022-12-13 08:20:01,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:01,056 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 528 flow [2022-12-13 08:20:01,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:01,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:01,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 528 flow [2022-12-13 08:20:01,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 52 transitions, 528 flow [2022-12-13 08:20:01,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 08:20:01,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:20:01,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:20:01,063 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 52 transitions, 528 flow [2022-12-13 08:20:01,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:01,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:01,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:01,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:20:01,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 810930479, now seen corresponding path program 1 times [2022-12-13 08:20:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:01,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447913336] [2022-12-13 08:20:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:20:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:01,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447913336] [2022-12-13 08:20:01,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447913336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:01,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:01,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:20:01,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610361675] [2022-12-13 08:20:01,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:01,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:20:01,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:20:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:20:01,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 08:20:01,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:01,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:01,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 08:20:01,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:01,357 INFO L130 PetriNetUnfolder]: 608/889 cut-off events. [2022-12-13 08:20:01,358 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-13 08:20:01,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 889 events. 608/889 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2867 event pairs, 73 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 4326. Up to 766 conditions per place. [2022-12-13 08:20:01,364 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 70 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2022-12-13 08:20:01,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:20:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:20:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 08:20:01,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 08:20:01,367 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-13 08:20:01,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:01,380 INFO L89 Accepts]: Start accepts. Operand has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:01,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:01,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:01,386 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:20:01,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 08:20:01,388 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 73 transitions, 874 flow [2022-12-13 08:20:01,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:01,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:01,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:01,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:20:01,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1326248150, now seen corresponding path program 1 times [2022-12-13 08:20:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939623629] [2022-12-13 08:20:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:20:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:01,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939623629] [2022-12-13 08:20:01,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939623629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:01,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:01,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:20:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400474759] [2022-12-13 08:20:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:01,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:20:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:20:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:20:01,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:20:01,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 73 transitions, 874 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:01,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:01,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:20:01,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:01,736 INFO L130 PetriNetUnfolder]: 638/954 cut-off events. [2022-12-13 08:20:01,736 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 08:20:01,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 954 events. 638/954 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3151 event pairs, 83 based on Foata normal form. 26/800 useless extension candidates. Maximal degree in co-relation 4998. Up to 823 conditions per place. [2022-12-13 08:20:01,742 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 68 selfloop transitions, 2 changer transitions 24/98 dead transitions. [2022-12-13 08:20:01,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 98 transitions, 1371 flow [2022-12-13 08:20:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:20:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:20:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 08:20:01,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2022-12-13 08:20:01,746 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 08:20:01,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 98 transitions, 1371 flow [2022-12-13 08:20:01,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 74 transitions, 1026 flow [2022-12-13 08:20:01,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:01,757 INFO L89 Accepts]: Start accepts. Operand has 47 places, 74 transitions, 1026 flow [2022-12-13 08:20:01,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:01,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:01,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 74 transitions, 1026 flow [2022-12-13 08:20:01,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 74 transitions, 1026 flow [2022-12-13 08:20:01,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:01,766 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:01,767 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:01,769 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:01,769 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:02,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:20:02,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-13 08:20:02,210 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 73 transitions, 1012 flow [2022-12-13 08:20:02,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:02,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:02,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:02,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:20:02,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1726749127, now seen corresponding path program 1 times [2022-12-13 08:20:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:02,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132985540] [2022-12-13 08:20:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:20:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:02,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132985540] [2022-12-13 08:20:02,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132985540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:02,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:02,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:20:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405963518] [2022-12-13 08:20:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:02,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:20:02,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:20:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:20:02,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 08:20:02,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 73 transitions, 1012 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:02,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:02,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 08:20:02,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:02,683 INFO L130 PetriNetUnfolder]: 1202/1735 cut-off events. [2022-12-13 08:20:02,684 INFO L131 PetriNetUnfolder]: For 3158/3158 co-relation queries the response was YES. [2022-12-13 08:20:02,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12795 conditions, 1735 events. 1202/1735 cut-off events. For 3158/3158 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6791 event pairs, 58 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 11722. Up to 1486 conditions per place. [2022-12-13 08:20:02,703 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 145 selfloop transitions, 31 changer transitions 0/176 dead transitions. [2022-12-13 08:20:02,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:20:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:20:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 08:20:02,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4228571428571429 [2022-12-13 08:20:02,705 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-13 08:20:02,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:02,722 INFO L89 Accepts]: Start accepts. Operand has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:02,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:02,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:02,729 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:20:02,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 08:20:02,729 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 176 transitions, 2763 flow [2022-12-13 08:20:02,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:02,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:02,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:02,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 08:20:02,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash -980746487, now seen corresponding path program 2 times [2022-12-13 08:20:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:02,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019035610] [2022-12-13 08:20:02,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:20:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:02,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019035610] [2022-12-13 08:20:02,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019035610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:20:02,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444980121] [2022-12-13 08:20:02,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:20:02,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:20:02,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:20:03,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:20:03,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 08:20:03,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:20:03,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:20:03,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 08:20:03,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:20:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 08:20:03,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:20:03,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444980121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:03,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:20:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 08:20:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496335825] [2022-12-13 08:20:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:20:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:20:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:20:03,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 08:20:03,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 176 transitions, 2763 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:03,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:03,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 08:20:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:03,832 INFO L130 PetriNetUnfolder]: 2012/2901 cut-off events. [2022-12-13 08:20:03,832 INFO L131 PetriNetUnfolder]: For 5233/5233 co-relation queries the response was YES. [2022-12-13 08:20:03,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24071 conditions, 2901 events. 2012/2901 cut-off events. For 5233/5233 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12457 event pairs, 0 based on Foata normal form. 0/2424 useless extension candidates. Maximal degree in co-relation 23360. Up to 2440 conditions per place. [2022-12-13 08:20:03,849 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 315 selfloop transitions, 51 changer transitions 0/366 dead transitions. [2022-12-13 08:20:03,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:20:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:20:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 08:20:03,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-13 08:20:03,852 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 08:20:03,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:03,884 INFO L89 Accepts]: Start accepts. Operand has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:03,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:03,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:03,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:20:03,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 08:20:03,900 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 366 transitions, 6519 flow [2022-12-13 08:20:03,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:03,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:03,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:03,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 08:20:04,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:20:04,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1050471491, now seen corresponding path program 1 times [2022-12-13 08:20:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:04,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031084905] [2022-12-13 08:20:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 08:20:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031084905] [2022-12-13 08:20:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031084905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:04,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:04,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:20:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080641609] [2022-12-13 08:20:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:20:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:20:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:20:04,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:20:04,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 366 transitions, 6519 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:04,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:04,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:20:04,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:04,898 INFO L130 PetriNetUnfolder]: 2098/3073 cut-off events. [2022-12-13 08:20:04,898 INFO L131 PetriNetUnfolder]: For 8369/8369 co-relation queries the response was YES. [2022-12-13 08:20:04,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28057 conditions, 3073 events. 2098/3073 cut-off events. For 8369/8369 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13486 event pairs, 0 based on Foata normal form. 86/2664 useless extension candidates. Maximal degree in co-relation 25724. Up to 2576 conditions per place. [2022-12-13 08:20:04,919 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 344 selfloop transitions, 2 changer transitions 62/429 dead transitions. [2022-12-13 08:20:04,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 429 transitions, 8508 flow [2022-12-13 08:20:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:20:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:20:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-13 08:20:04,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 08:20:04,921 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-12-13 08:20:04,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 429 transitions, 8508 flow [2022-12-13 08:20:04,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 367 transitions, 7229 flow [2022-12-13 08:20:04,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:04,957 INFO L89 Accepts]: Start accepts. Operand has 57 places, 367 transitions, 7229 flow [2022-12-13 08:20:04,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:04,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:04,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 367 transitions, 7229 flow [2022-12-13 08:20:04,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 367 transitions, 7229 flow [2022-12-13 08:20:04,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:04,974 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:04,975 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:04,977 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:04,978 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:05,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:20:05,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-13 08:20:05,338 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 366 transitions, 7209 flow [2022-12-13 08:20:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:05,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:05,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:05,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 08:20:05,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1141000507, now seen corresponding path program 1 times [2022-12-13 08:20:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675000880] [2022-12-13 08:20:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 08:20:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:05,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675000880] [2022-12-13 08:20:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675000880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:20:05,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:20:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:20:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631549238] [2022-12-13 08:20:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:20:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:20:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:20:05,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:20:05,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:20:05,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 366 transitions, 7209 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:05,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:05,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:20:05,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:05,940 INFO L130 PetriNetUnfolder]: 2012/2902 cut-off events. [2022-12-13 08:20:05,941 INFO L131 PetriNetUnfolder]: For 9795/9795 co-relation queries the response was YES. [2022-12-13 08:20:05,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28962 conditions, 2902 events. 2012/2902 cut-off events. For 9795/9795 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12435 event pairs, 0 based on Foata normal form. 0/2425 useless extension candidates. Maximal degree in co-relation 28088. Up to 2441 conditions per place. [2022-12-13 08:20:05,960 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 343 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2022-12-13 08:20:05,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:20:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:20:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 08:20:05,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30714285714285716 [2022-12-13 08:20:05,962 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-13 08:20:05,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:05,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:06,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:06,001 INFO L89 Accepts]: Start accepts. Operand has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:06,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:06,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:06,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:06,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 367 transitions, 7921 flow [2022-12-13 08:20:06,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:06,018 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:06,019 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:06,021 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:06,021 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:06,288 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:20:06,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 288 [2022-12-13 08:20:06,289 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 366 transitions, 7899 flow [2022-12-13 08:20:06,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:06,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:06,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:06,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:20:06,289 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash -896891853, now seen corresponding path program 1 times [2022-12-13 08:20:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:06,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231459205] [2022-12-13 08:20:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231459205] [2022-12-13 08:20:07,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231459205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:20:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173984876] [2022-12-13 08:20:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:07,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:20:07,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:20:07,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:20:07,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 08:20:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:07,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 08:20:07,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:20:07,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 08:20:07,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:08,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 08:20:08,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:08,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 08:20:08,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:08,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 08:20:08,437 INFO L321 Elim1Store]: treesize reduction 69, result has 41.0 percent of original size [2022-12-13 08:20:08,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 92 [2022-12-13 08:20:08,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:20:08,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:08,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 59 [2022-12-13 08:20:08,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-12-13 08:20:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:08,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:20:08,617 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-12-13 08:20:08,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 186 [2022-12-13 08:20:08,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:08,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 152 [2022-12-13 08:20:09,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:09,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2022-12-13 08:20:09,282 INFO L321 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-12-13 08:20:09,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 60 [2022-12-13 08:20:09,289 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 08:20:09,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2022-12-13 08:20:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173984876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:20:09,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:20:09,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 26 [2022-12-13 08:20:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079587075] [2022-12-13 08:20:09,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:20:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 08:20:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:09,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 08:20:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-12-13 08:20:09,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 08:20:09,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 366 transitions, 7899 flow. Second operand has 27 states, 27 states have (on average 5.0) internal successors, (135), 27 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:09,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:09,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 08:20:09,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:16,138 INFO L130 PetriNetUnfolder]: 15947/22897 cut-off events. [2022-12-13 08:20:16,138 INFO L131 PetriNetUnfolder]: For 108944/108944 co-relation queries the response was YES. [2022-12-13 08:20:16,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251107 conditions, 22897 events. 15947/22897 cut-off events. For 108944/108944 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 138563 event pairs, 77 based on Foata normal form. 10/18869 useless extension candidates. Maximal degree in co-relation 169144. Up to 19684 conditions per place. [2022-12-13 08:20:16,353 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 2277 selfloop transitions, 541 changer transitions 348/3187 dead transitions. [2022-12-13 08:20:16,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 3187 transitions, 77514 flow [2022-12-13 08:20:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:20:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:20:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 441 transitions. [2022-12-13 08:20:16,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34054054054054056 [2022-12-13 08:20:16,356 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2022-12-13 08:20:16,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 3187 transitions, 77514 flow [2022-12-13 08:20:16,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 2839 transitions, 69003 flow [2022-12-13 08:20:16,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:16,614 INFO L89 Accepts]: Start accepts. Operand has 93 places, 2839 transitions, 69003 flow [2022-12-13 08:20:16,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:16,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:16,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 2839 transitions, 69003 flow [2022-12-13 08:20:16,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 2839 transitions, 69003 flow [2022-12-13 08:20:16,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:16,716 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:16,716 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:16,718 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:16,718 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:16,987 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:16,988 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:16,989 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:16,990 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:17,404 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:17,404 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:17,406 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:17,406 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:17,407 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:17,408 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:17,859 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:17,860 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:17,861 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:17,862 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:18,378 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:18,380 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:18,383 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:18,384 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:18,385 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:18,385 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,336 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,337 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,339 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,340 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,342 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,343 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2022-12-13 08:20:19,353 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,354 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,358 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,359 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,360 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,361 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:19,363 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:19,364 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:20,384 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:20,385 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:20,387 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:20,387 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:20,808 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:20,809 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:20,812 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:20,813 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:21,333 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:21,333 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:21,334 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:21,335 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:21,794 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:21,794 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:21,809 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:21,809 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:21,811 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:21,811 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:24,326 INFO L241 LiptonReduction]: Total number of compositions: 10 [2022-12-13 08:20:24,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7715 [2022-12-13 08:20:24,329 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 2829 transitions, 68763 flow [2022-12-13 08:20:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.0) internal successors, (135), 27 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:20:24,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:20:24,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:20:24,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 08:20:24,537 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,SelfDestructingSolverStorable10 [2022-12-13 08:20:24,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:20:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:20:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash 297888396, now seen corresponding path program 1 times [2022-12-13 08:20:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:20:24,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196867508] [2022-12-13 08:20:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:20:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:20:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196867508] [2022-12-13 08:20:25,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196867508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:20:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643184407] [2022-12-13 08:20:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:20:25,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:20:25,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:20:25,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:20:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 08:20:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:20:25,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 08:20:25,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:20:25,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-13 08:20:25,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-13 08:20:25,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:25,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 08:20:25,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:20:25,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:25,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 08:20:25,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:20:25,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:20:25,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 08:20:25,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:20:26,067 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 08:20:26,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 61 [2022-12-13 08:20:26,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-12-13 08:20:26,097 INFO L321 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2022-12-13 08:20:26,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 64 [2022-12-13 08:20:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:26,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:20:26,246 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-12-13 08:20:26,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 186 [2022-12-13 08:20:27,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:27,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-12-13 08:20:27,078 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 08:20:27,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 373 [2022-12-13 08:20:27,087 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 08:20:27,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 270 [2022-12-13 08:20:27,094 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 08:20:27,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2022-12-13 08:20:27,101 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 08:20:27,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 198 [2022-12-13 08:20:27,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:27,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2022-12-13 08:20:27,207 INFO L321 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-12-13 08:20:27,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 506 treesize of output 482 [2022-12-13 08:20:27,218 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 08:20:27,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 454 treesize of output 362 [2022-12-13 08:20:27,228 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 08:20:27,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 282 [2022-12-13 08:20:27,246 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 08:20:27,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 122 [2022-12-13 08:20:27,262 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 08:20:27,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 1 [2022-12-13 08:20:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:20:27,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643184407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:20:27,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:20:27,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-13 08:20:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063707311] [2022-12-13 08:20:27,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:20:27,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:20:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:20:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:20:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=237, Unknown=5, NotChecked=0, Total=306 [2022-12-13 08:20:27,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2022-12-13 08:20:27,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 2829 transitions, 68763 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 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 08:20:27,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:20:27,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2022-12-13 08:20:27,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:20:31,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:20:33,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:20:48,820 INFO L130 PetriNetUnfolder]: 27820/40322 cut-off events. [2022-12-13 08:20:48,821 INFO L131 PetriNetUnfolder]: For 247355/247355 co-relation queries the response was YES. [2022-12-13 08:20:48,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476398 conditions, 40322 events. 27820/40322 cut-off events. For 247355/247355 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 268486 event pairs, 179 based on Foata normal form. 20/33149 useless extension candidates. Maximal degree in co-relation 250560. Up to 34677 conditions per place. [2022-12-13 08:20:49,106 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 3637 selfloop transitions, 476 changer transitions 1460/5594 dead transitions. [2022-12-13 08:20:49,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 5594 transitions, 147268 flow [2022-12-13 08:20:49,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 08:20:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 08:20:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2022-12-13 08:20:49,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3368421052631579 [2022-12-13 08:20:49,108 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 65 predicate places. [2022-12-13 08:20:49,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 5594 transitions, 147268 flow [2022-12-13 08:20:49,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 4134 transitions, 108831 flow [2022-12-13 08:20:49,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:20:49,782 INFO L89 Accepts]: Start accepts. Operand has 98 places, 4134 transitions, 108831 flow [2022-12-13 08:20:49,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:20:49,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:20:49,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 4134 transitions, 108831 flow [2022-12-13 08:20:49,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 4134 transitions, 108831 flow [2022-12-13 08:20:49,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:20:49,986 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:49,987 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:49,988 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:49,989 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:49,994 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:49,994 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:49,998 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:49,998 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:50,001 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:50,002 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2022-12-13 08:20:50,005 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:50,005 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:50,008 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:50,008 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:50,010 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:50,010 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:50,011 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:50,012 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,979 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,980 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,981 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,982 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,983 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,984 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,988 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,988 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-13 08:20:56,991 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,991 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,993 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,994 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2022-12-13 08:20:56,997 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:56,997 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:56,999 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,000 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:57,004 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,005 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2022-12-13 08:20:57,008 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,009 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:57,012 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,012 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:57,014 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,015 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:57,018 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,018 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:20:57,019 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:20:57,020 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 08:21:01,538 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 08:21:01,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11758 [2022-12-13 08:21:01,540 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 4132 transitions, 108779 flow [2022-12-13 08:21:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 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 08:21:01,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:21:01,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:21:01,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 08:21:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:21:01,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 08:21:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:21:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -480990421, now seen corresponding path program 1 times [2022-12-13 08:21:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:21:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427568720] [2022-12-13 08:21:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:21:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:21:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:21:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:21:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:21:03,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427568720] [2022-12-13 08:21:03,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427568720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:21:03,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444415830] [2022-12-13 08:21:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:21:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:21:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:21:03,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:21:03,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 08:21:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:21:04,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 08:21:04,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:21:04,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-13 08:21:04,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-13 08:21:04,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-12-13 08:21:04,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 08:21:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 08:21:04,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 08:21:04,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,457 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 08:21:04,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2022-12-13 08:21:04,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2022-12-13 08:21:04,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:21:04,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2022-12-13 08:21:04,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2022-12-13 08:21:04,689 INFO L321 Elim1Store]: treesize reduction 41, result has 49.4 percent of original size [2022-12-13 08:21:04,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 67 [2022-12-13 08:21:04,699 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-13 08:21:04,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-12-13 08:21:04,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-12-13 08:21:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:21:04,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:21:04,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:21:04,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 424 treesize of output 538 [2022-12-13 08:21:04,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:21:04,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 349 treesize of output 354 Received shutdown request... [2022-12-13 08:33:54,135 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 08:33:54,140 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:33:54,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 08:33:54,152 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:33:54,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:33:54,341 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-13-3-2-1 context. [2022-12-13 08:33:54,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 08:33:54,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 08:33:54,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 08:33:54,343 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:33:54,345 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:33:54,345 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:33:54,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:33:54 BasicIcfg [2022-12-13 08:33:54,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:33:54,347 INFO L158 Benchmark]: Toolchain (without parser) took 850705.00ms. Allocated memory was 186.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 163.6MB in the beginning and 324.2MB in the end (delta: -160.6MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 08:33:54,347 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:33:54,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.59ms. Allocated memory is still 186.6MB. Free memory was 163.6MB in the beginning and 149.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:33:54,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.55ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 146.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 08:33:54,348 INFO L158 Benchmark]: Boogie Preprocessor took 44.93ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 143.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 08:33:54,348 INFO L158 Benchmark]: RCFGBuilder took 752.07ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 96.0MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-12-13 08:33:54,348 INFO L158 Benchmark]: TraceAbstraction took 849547.12ms. Allocated memory was 186.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 94.9MB in the beginning and 324.2MB in the end (delta: -229.3MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-13 08:33:54,350 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 186.6MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.59ms. Allocated memory is still 186.6MB. Free memory was 163.6MB in the beginning and 149.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.55ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 146.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.93ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 143.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 752.07ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 96.0MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 849547.12ms. Allocated memory was 186.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 94.9MB in the beginning and 324.2MB in the end (delta: -229.3MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 334 PlacesBefore, 36 PlacesAfterwards, 361 TransitionsBefore, 36 TransitionsAfterwards, 4578 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 227 TrivialYvCompositions, 71 ConcurrentYvCompositions, 27 ChoiceCompositions, 327 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 3153, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3174, independent: 3153, independent conditional: 0, independent unconditional: 3153, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2947, independent: 2936, independent conditional: 0, independent unconditional: 2936, 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: 2947, independent: 2929, independent conditional: 0, independent unconditional: 2929, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3174, independent: 217, independent conditional: 0, independent unconditional: 217, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2947, unknown conditional: 0, unknown unconditional: 2947] , Statistics on independence cache: Total cache size (in pairs): 5320, Positive cache size: 5309, Positive conditional cache size: 0, Positive unconditional cache size: 5309, 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, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 42 PlacesBefore, 41 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 9, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 47 PlacesBefore, 46 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 50 PlacesBefore, 50 PlacesAfterwards, 176 TransitionsBefore, 176 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 55 PlacesBefore, 55 PlacesAfterwards, 366 TransitionsBefore, 366 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 57 PlacesBefore, 56 PlacesAfterwards, 367 TransitionsBefore, 366 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 59 PlacesBefore, 58 PlacesAfterwards, 367 TransitionsBefore, 366 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 7.6s, 93 PlacesBefore, 83 PlacesAfterwards, 2839 TransitionsBefore, 2829 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 11.6s, 98 PlacesBefore, 96 PlacesAfterwards, 4134 TransitionsBefore, 4132 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-13-3-2-1 context. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-13-3-2-1 context. - TimeoutResultAtElement [Line: 133]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-13-3-2-1 context. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 28 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-13-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 410 locations, 4 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: 849.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1355 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1355 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3434 IncrementalHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 1 mSDtfsCounter, 3434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108831occurred in iteration=12, InterpolantAutomatonStates: 102, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 459 ConstructedInterpolants, 34 QuantifiedInterpolants, 8893 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1552 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 39/58 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