/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:14:29,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:14:29,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:14:29,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:14:29,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:14:29,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:14:29,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:14:29,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:14:29,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:14:29,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:14:29,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:14:29,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:14:29,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:14:29,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:14:29,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:14:29,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:14:29,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:14:29,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:14:29,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:14:29,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:14:29,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:14:29,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:14:29,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:14:29,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:14:29,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:14:29,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:14:29,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:14:29,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:14:29,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:14:29,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:14:29,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:14:29,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:14:29,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:14:29,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:14:29,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:14:29,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:14:29,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:14:29,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:14:29,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:14:29,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:14:29,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:14:29,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:14:29,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:14:29,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:14:29,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:14:29,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:14:29,807 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:14:29,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:14:29,808 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:14:29,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:14:29,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:14:29,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:14:29,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:14:29,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:14:29,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:14:29,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:14:29,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:14:30,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:14:30,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:14:30,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:14:30,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:14:30,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:14:30,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-12-06 06:14:31,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:14:31,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:14:31,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-12-06 06:14:31,478 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba08b3334/f37e0d3f94b14741a2d0b515880ec3b5/FLAG126737782 [2022-12-06 06:14:31,493 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba08b3334/f37e0d3f94b14741a2d0b515880ec3b5 [2022-12-06 06:14:31,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:14:31,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:14:31,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:14:31,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:14:31,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:14:31,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:31,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3107ff9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31, skipping insertion in model container [2022-12-06 06:14:31,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:31,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:14:31,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:14:31,840 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-12-06 06:14:31,846 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-12-06 06:14:31,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:14:31,864 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:14:31,892 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-12-06 06:14:31,894 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-12-06 06:14:31,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:14:31,946 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:14:31,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31 WrapperNode [2022-12-06 06:14:31,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:14:31,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:14:31,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:14:31,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:14:31,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:31,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,012 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-06 06:14:32,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:14:32,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:14:32,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:14:32,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:14:32,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:14:32,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:14:32,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:14:32,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:14:32,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (1/1) ... [2022-12-06 06:14:32,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:14:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:32,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:14:32,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:14:32,150 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:14:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:14:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:14:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:14:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:14:32,152 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:14:32,340 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:14:32,342 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:14:32,649 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:14:32,661 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:14:32,662 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:14:32,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:14:32 BoogieIcfgContainer [2022-12-06 06:14:32,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:14:32,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:14:32,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:14:32,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:14:32,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:14:31" (1/3) ... [2022-12-06 06:14:32,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639dea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:14:32, skipping insertion in model container [2022-12-06 06:14:32,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:14:31" (2/3) ... [2022-12-06 06:14:32,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639dea67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:14:32, skipping insertion in model container [2022-12-06 06:14:32,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:14:32" (3/3) ... [2022-12-06 06:14:32,670 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-06 06:14:32,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:14:32,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:14:32,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:14:32,823 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:14:32,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 06:14:33,004 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-06 06:14:33,004 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:14:33,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 06:14:33,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-06 06:14:33,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-06 06:14:33,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:33,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 06:14:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-06 06:14:33,116 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-06 06:14:33,116 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:14:33,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 13/204 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 06:14:33,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-06 06:14:33,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-06 06:14:41,714 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-06 06:14:41,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:14:41,730 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;@1328ff07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:14:41,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:14:41,732 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 06:14:41,732 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:14:41,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:41,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 06:14:41,733 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 2 more)] === [2022-12-06 06:14:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 847, now seen corresponding path program 1 times [2022-12-06 06:14:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308404772] [2022-12-06 06:14:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308404772] [2022-12-06 06:14:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308404772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:14:41,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:14:41,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 06:14:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675373183] [2022-12-06 06:14:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:14:41,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:14:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:14:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:14:41,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2022-12-06 06:14:41,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:41,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:41,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2022-12-06 06:14:41,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:42,095 INFO L130 PetriNetUnfolder]: 751/1277 cut-off events. [2022-12-06 06:14:42,096 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 06:14:42,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 1277 events. 751/1277 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5564 event pairs, 582 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 2344. Up to 1178 conditions per place. [2022-12-06 06:14:42,106 INFO L137 encePairwiseOnDemand]: 45/47 looper letters, 38 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-12-06 06:14:42,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 175 flow [2022-12-06 06:14:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:14:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:14:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-12-06 06:14:42,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-06 06:14:42,116 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 103 flow. Second operand 2 states and 54 transitions. [2022-12-06 06:14:42,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 175 flow [2022-12-06 06:14:42,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:14:42,120 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 94 flow [2022-12-06 06:14:42,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2022-12-06 06:14:42,124 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2022-12-06 06:14:42,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:42,124 INFO L89 Accepts]: Start accepts. Operand has 43 places, 45 transitions, 94 flow [2022-12-06 06:14:42,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:42,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:42,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 45 transitions, 94 flow [2022-12-06 06:14:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 45 transitions, 94 flow [2022-12-06 06:14:42,133 INFO L130 PetriNetUnfolder]: 7/45 cut-off events. [2022-12-06 06:14:42,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:14:42,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 45 events. 7/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2022-12-06 06:14:42,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 45 transitions, 94 flow [2022-12-06 06:14:42,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-06 06:14:42,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:14:42,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 06:14:42,211 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 45 transitions, 94 flow [2022-12-06 06:14:42,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:42,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:42,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:42,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:14:42,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash 912681828, now seen corresponding path program 1 times [2022-12-06 06:14:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030835163] [2022-12-06 06:14:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:42,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030835163] [2022-12-06 06:14:42,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030835163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:14:42,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:14:42,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:14:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725817692] [2022-12-06 06:14:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:14:42,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:14:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:14:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:14:42,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-06 06:14:42,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:42,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:42,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-06 06:14:42,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:42,520 INFO L130 PetriNetUnfolder]: 289/549 cut-off events. [2022-12-06 06:14:42,520 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:14:42,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 549 events. 289/549 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2117 event pairs, 195 based on Foata normal form. 28/476 useless extension candidates. Maximal degree in co-relation 728. Up to 324 conditions per place. [2022-12-06 06:14:42,522 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 36 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2022-12-06 06:14:42,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 211 flow [2022-12-06 06:14:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:14:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:14:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 06:14:42,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-06 06:14:42,524 INFO L175 Difference]: Start difference. First operand has 42 places, 45 transitions, 94 flow. Second operand 3 states and 67 transitions. [2022-12-06 06:14:42,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 211 flow [2022-12-06 06:14:42,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:14:42,526 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 90 flow [2022-12-06 06:14:42,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 06:14:42,527 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-06 06:14:42,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:42,527 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 90 flow [2022-12-06 06:14:42,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:42,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:42,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 90 flow [2022-12-06 06:14:42,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 90 flow [2022-12-06 06:14:42,532 INFO L130 PetriNetUnfolder]: 5/39 cut-off events. [2022-12-06 06:14:42,532 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:14:42,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2022-12-06 06:14:42,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 90 flow [2022-12-06 06:14:42,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 06:14:43,493 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 06:14:43,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 968 [2022-12-06 06:14:43,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 72 flow [2022-12-06 06:14:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:43,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:43,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:14:43,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1680390944, now seen corresponding path program 1 times [2022-12-06 06:14:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:43,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709097129] [2022-12-06 06:14:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:43,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709097129] [2022-12-06 06:14:43,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709097129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:14:43,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:14:43,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:14:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072424008] [2022-12-06 06:14:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:14:43,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:14:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:14:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:14:43,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:14:43,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:43,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:43,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:14:43,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:43,688 INFO L130 PetriNetUnfolder]: 66/147 cut-off events. [2022-12-06 06:14:43,688 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:14:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 66/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 471 event pairs, 3 based on Foata normal form. 18/149 useless extension candidates. Maximal degree in co-relation 157. Up to 121 conditions per place. [2022-12-06 06:14:43,690 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 29 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 06:14:43,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 149 flow [2022-12-06 06:14:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:14:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:14:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:14:43,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 06:14:43,695 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 72 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:14:43,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 149 flow [2022-12-06 06:14:43,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:14:43,697 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 74 flow [2022-12-06 06:14:43,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2022-12-06 06:14:43,698 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-06 06:14:43,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:43,699 INFO L89 Accepts]: Start accepts. Operand has 32 places, 30 transitions, 74 flow [2022-12-06 06:14:43,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:43,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:43,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-06 06:14:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2022-12-06 06:14:43,705 INFO L130 PetriNetUnfolder]: 5/31 cut-off events. [2022-12-06 06:14:43,705 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:14:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 31 events. 5/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2022-12-06 06:14:43,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 30 transitions, 74 flow [2022-12-06 06:14:43,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 06:14:43,830 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:14:43,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 06:14:43,832 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 70 flow [2022-12-06 06:14:43,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:43,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:43,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:43,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:14:43,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 659984688, now seen corresponding path program 1 times [2022-12-06 06:14:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:43,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47994532] [2022-12-06 06:14:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:43,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:43,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47994532] [2022-12-06 06:14:43,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47994532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:14:43,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:14:43,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:14:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16783372] [2022-12-06 06:14:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:14:43,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:14:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:14:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:14:43,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:14:43,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:43,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:43,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:14:43,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:43,998 INFO L130 PetriNetUnfolder]: 90/201 cut-off events. [2022-12-06 06:14:44,002 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:14:44,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 201 events. 90/201 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 618 event pairs, 42 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 180. Up to 126 conditions per place. [2022-12-06 06:14:44,003 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 34 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-12-06 06:14:44,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 172 flow [2022-12-06 06:14:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:14:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:14:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:14:44,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:14:44,004 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 70 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:14:44,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 172 flow [2022-12-06 06:14:44,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:14:44,005 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 77 flow [2022-12-06 06:14:44,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 06:14:44,006 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2022-12-06 06:14:44,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:44,006 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 77 flow [2022-12-06 06:14:44,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:44,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:44,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 77 flow [2022-12-06 06:14:44,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 77 flow [2022-12-06 06:14:44,010 INFO L130 PetriNetUnfolder]: 6/37 cut-off events. [2022-12-06 06:14:44,010 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:14:44,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 37 events. 6/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2022-12-06 06:14:44,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 77 flow [2022-12-06 06:14:44,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 06:14:44,019 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:14:44,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:14:44,020 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 77 flow [2022-12-06 06:14:44,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:44,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:44,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:44,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:14:44,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1671174728, now seen corresponding path program 1 times [2022-12-06 06:14:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:44,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972811732] [2022-12-06 06:14:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:44,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:44,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972811732] [2022-12-06 06:14:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972811732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910550275] [2022-12-06 06:14:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:44,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:44,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:44,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:14:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:44,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:14:44,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:44,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910550275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:44,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:44,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 06:14:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025944061] [2022-12-06 06:14:44,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:44,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:14:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:14:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:14:44,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:14:44,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 77 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:44,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:44,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:14:44,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:44,388 INFO L130 PetriNetUnfolder]: 137/316 cut-off events. [2022-12-06 06:14:44,389 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 06:14:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 316 events. 137/316 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 794 event pairs, 21 based on Foata normal form. 12/300 useless extension candidates. Maximal degree in co-relation 245. Up to 69 conditions per place. [2022-12-06 06:14:44,390 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 56 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2022-12-06 06:14:44,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 285 flow [2022-12-06 06:14:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:14:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:14:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 06:14:44,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2022-12-06 06:14:44,391 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 77 flow. Second operand 6 states and 77 transitions. [2022-12-06 06:14:44,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 285 flow [2022-12-06 06:14:44,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:14:44,393 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-06 06:14:44,393 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2022-12-06 06:14:44,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:44,393 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:44,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:44,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,400 INFO L130 PetriNetUnfolder]: 8/58 cut-off events. [2022-12-06 06:14:44,400 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:14:44,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 58 events. 8/58 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-12-06 06:14:44,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 06:14:44,404 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:14:44,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 06:14:44,405 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 115 flow [2022-12-06 06:14:44,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:44,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:44,405 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:44,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:14:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:44,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2052387022, now seen corresponding path program 2 times [2022-12-06 06:14:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:44,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082410118] [2022-12-06 06:14:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082410118] [2022-12-06 06:14:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082410118] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920824768] [2022-12-06 06:14:44,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:14:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:44,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:44,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:14:44,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:14:44,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:14:44,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:14:44,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:44,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:45,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920824768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:45,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:45,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-06 06:14:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706511008] [2022-12-06 06:14:45,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:45,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:14:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:14:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:14:45,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 06:14:45,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:45,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:45,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 06:14:45,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:45,234 INFO L130 PetriNetUnfolder]: 287/682 cut-off events. [2022-12-06 06:14:45,234 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-06 06:14:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 682 events. 287/682 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1772 event pairs, 21 based on Foata normal form. 24/654 useless extension candidates. Maximal degree in co-relation 602. Up to 80 conditions per place. [2022-12-06 06:14:45,238 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 116 selfloop transitions, 12 changer transitions 0/130 dead transitions. [2022-12-06 06:14:45,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 655 flow [2022-12-06 06:14:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:14:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:14:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-12-06 06:14:45,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2022-12-06 06:14:45,240 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 115 flow. Second operand 12 states and 158 transitions. [2022-12-06 06:14:45,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 655 flow [2022-12-06 06:14:45,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 130 transitions, 635 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 06:14:45,244 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=203, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-06 06:14:45,245 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2022-12-06 06:14:45,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:45,245 INFO L89 Accepts]: Start accepts. Operand has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:45,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:45,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,260 INFO L130 PetriNetUnfolder]: 14/118 cut-off events. [2022-12-06 06:14:45,260 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 06:14:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 118 events. 14/118 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 193. Up to 20 conditions per place. [2022-12-06 06:14:45,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:14:45,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:14:45,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:14:45,265 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 203 flow [2022-12-06 06:14:45,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:45,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:45,265 INFO L213 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:45,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 06:14:45,472 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,SelfDestructingSolverStorable5 [2022-12-06 06:14:45,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash -530161422, now seen corresponding path program 3 times [2022-12-06 06:14:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847447014] [2022-12-06 06:14:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847447014] [2022-12-06 06:14:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847447014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134632419] [2022-12-06 06:14:45,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 06:14:45,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:45,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:45,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:14:46,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 06:14:46,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:14:46,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 06:14:46,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:46,545 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 13 treesize of output 9 [2022-12-06 06:14:46,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:14:46,567 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 16 treesize of output 18 [2022-12-06 06:14:46,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:14:46,619 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 06:14:46,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 06:14:46,651 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 23 treesize of output 22 [2022-12-06 06:14:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-12-06 06:14:46,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:46,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_571 Int) (v_ArrVal_570 (Array Int Int))) (not (<= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_571)) .cse1))))) is different from false [2022-12-06 06:14:46,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:14:46,773 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 49 treesize of output 40 [2022-12-06 06:14:46,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:14:46,781 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 63 treesize of output 65 [2022-12-06 06:14:46,784 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 63 treesize of output 51 [2022-12-06 06:14:46,793 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 8 treesize of output 4 [2022-12-06 06:14:46,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:14:46,807 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 51 treesize of output 43 [2022-12-06 06:14:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 204 trivial. 9 not checked. [2022-12-06 06:14:46,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134632419] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:46,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:46,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 9] total 27 [2022-12-06 06:14:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855253683] [2022-12-06 06:14:46,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:46,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 06:14:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 06:14:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=483, Unknown=1, NotChecked=48, Total=702 [2022-12-06 06:14:46,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:14:46,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 203 flow. Second operand has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:46,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:46,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:14:46,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:49,481 INFO L130 PetriNetUnfolder]: 777/1709 cut-off events. [2022-12-06 06:14:49,482 INFO L131 PetriNetUnfolder]: For 1511/1511 co-relation queries the response was YES. [2022-12-06 06:14:49,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 1709 events. 777/1709 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5756 event pairs, 20 based on Foata normal form. 24/1646 useless extension candidates. Maximal degree in co-relation 2759. Up to 234 conditions per place. [2022-12-06 06:14:49,489 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 284 selfloop transitions, 114 changer transitions 0/398 dead transitions. [2022-12-06 06:14:49,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 398 transitions, 2093 flow [2022-12-06 06:14:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-06 06:14:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-06 06:14:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 417 transitions. [2022-12-06 06:14:49,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32175925925925924 [2022-12-06 06:14:49,492 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 203 flow. Second operand 48 states and 417 transitions. [2022-12-06 06:14:49,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 398 transitions, 2093 flow [2022-12-06 06:14:49,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 398 transitions, 2081 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:14:49,517 INFO L231 Difference]: Finished difference. Result has 129 places, 156 transitions, 1181 flow [2022-12-06 06:14:49,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1181, PETRI_PLACES=129, PETRI_TRANSITIONS=156} [2022-12-06 06:14:49,518 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2022-12-06 06:14:49,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:49,518 INFO L89 Accepts]: Start accepts. Operand has 129 places, 156 transitions, 1181 flow [2022-12-06 06:14:49,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:49,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:49,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 156 transitions, 1181 flow [2022-12-06 06:14:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 156 transitions, 1181 flow [2022-12-06 06:14:49,684 INFO L130 PetriNetUnfolder]: 113/571 cut-off events. [2022-12-06 06:14:49,684 INFO L131 PetriNetUnfolder]: For 6888/6888 co-relation queries the response was YES. [2022-12-06 06:14:49,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 571 events. 113/571 cut-off events. For 6888/6888 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1664 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 2128. Up to 79 conditions per place. [2022-12-06 06:14:49,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 156 transitions, 1181 flow [2022-12-06 06:14:49,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-06 06:14:49,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_388|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_389|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_388|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] and [801] L1011-5-->L980-1: Formula: (and (< |v_t1Thread1of1ForFork0_~i~0#1_47| 400) (= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17| |v_~#queue~0.base_64|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_~#queue~0.offset_59|) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_24| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19| |v_t1Thread1of1ForFork0_~value~0#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_37| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|) (= (select (select |v_#memory_int_538| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|)) InVars {~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, #memory_int=|v_#memory_int_538|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_24|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_47|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_163|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_35|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_39|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_17|, ~#queue~0.base=|v_~#queue~0.base_64|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_163|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_19|, #memory_int=|v_#memory_int_538|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_37|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_35|, ~#queue~0.offset=|v_~#queue~0.offset_59|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_47|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_17|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_65|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_35|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 06:14:50,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L1052-4-->L1053-3: Formula: (and (= (+ |v_#pthreadsForks_20| 1) |v_#pthreadsForks_19|) (= |v_ULTIMATE.start_main_#t~pre61#1_21| |v_#pthreadsForks_20|) (= (store |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_389| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre61#1_21|)) |v_#memory_int_388|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_20|, #memory_int=|v_#memory_int_389|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_21|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_19|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_15|, #memory_int=|v_#memory_int_388|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet60#1, #memory_int, ULTIMATE.start_main_#t~pre59#1] and [835] $Ultimate##0-->L980-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_285| |v_~#m~0.base_146|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331|) (not (= (mod v_~enqueue_flag~0_139 256) 0)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49| |v_~#queue~0.base_150|) (= (store |v_#pthreadsMutex_285| |v_~#m~0.base_146| (store .cse0 |v_~#m~0.offset_146| 1)) |v_#pthreadsMutex_284|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select (select |v_#memory_int_1086| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_331|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331| 1604))) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_331| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_~#queue~0.offset_145|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_100| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_~value~0#1_125| |v_t1Thread1of1ForFork0_#t~nondet51#1_57|) (= |v_t1Thread1of1ForFork0_~i~0#1_194| 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_46| |v_t1Thread1of1ForFork0_~arg#1.offset_49|) (= (select .cse0 |v_~#m~0.offset_146|) 0) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_57| 2147483648)) (= |v_t1Thread1of1ForFork0_~value~0#1_125| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|) (= |v_t1Thread1of1ForFork0_~arg#1.base_49| |v_t1Thread1of1ForFork0_#in~arg#1.base_46|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_285|, ~#m~0.base=|v_~#m~0.base_146|, ~#queue~0.base=|v_~#queue~0.base_150|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, #memory_int=|v_#memory_int_1086|, ~#queue~0.offset=|v_~#queue~0.offset_145|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_57|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_194|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_49|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_331|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_125|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|, ~#queue~0.base=|v_~#queue~0.base_150|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_331|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_51|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_150|, ~#queue~0.offset=|v_~#queue~0.offset_145|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_49|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_104|, #pthreadsMutex=|v_#pthreadsMutex_284|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_109|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_46|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128|, ~#m~0.base=|v_~#m~0.base_146|, ~enqueue_flag~0=v_~enqueue_flag~0_139, ~#m~0.offset=|v_~#m~0.offset_146|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_73|, #memory_int=|v_#memory_int_1086|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_100|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_146|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_46|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_116|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 06:14:50,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->L1011-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_264| |v_~#m~0.base_140|))) (and (= (store |v_#pthreadsMutex_264| |v_~#m~0.base_140| (store .cse0 |v_~#m~0.offset_140| 1)) |v_#pthreadsMutex_263|) (= (select .cse0 |v_~#m~0.offset_140|) 0) (= |v_t1Thread1of1ForFork0_~arg#1.base_43| |v_t1Thread1of1ForFork0_#in~arg#1.base_43|) (= |v_t1Thread1of1ForFork0_~i~0#1_115| 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_43| |v_t1Thread1of1ForFork0_~arg#1.offset_43|) (not (= (mod v_~enqueue_flag~0_130 256) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_264|, ~#m~0.base=|v_~#m~0.base_140|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_263|, ~#m~0.base=|v_~#m~0.base_140|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_115|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_43|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_83|, ~enqueue_flag~0=v_~enqueue_flag~0_130, ~#m~0.offset=|v_~#m~0.offset_140|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_65|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_43|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_43|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_43|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base] and [836] L1052-4-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_#t~nondet51#1_61|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_333| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_102| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|) (<= |v_t1Thread1of1ForFork0_#t~nondet51#1_61| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet51#1_61| 2147483648)) (< |v_t1Thread1of1ForFork0_~i~0#1_196| 400) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51| |v_~#queue~0.offset_147|) (= (select (select |v_#memory_int_1088| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_333|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_130|) (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51| |v_~#queue~0.base_152|) (= (+ |v_#pthreadsForks_153| 1) |v_#pthreadsForks_152|) (= |v_#memory_int_1088| (store |v_#memory_int_1089| |v_ULTIMATE.start_main_~#id2~0#1.base_113| (store (select |v_#memory_int_1089| |v_ULTIMATE.start_main_~#id2~0#1.base_113|) |v_ULTIMATE.start_main_~#id2~0#1.offset_113| |v_ULTIMATE.start_main_#t~pre61#1_121|))) (= |v_ULTIMATE.start_main_#t~pre61#1_121| |v_#pthreadsForks_153|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_113|, ~#queue~0.base=|v_~#queue~0.base_152|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_196|, #pthreadsForks=|v_#pthreadsForks_153|, #memory_int=|v_#memory_int_1089|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_#t~nondet51#1=|v_t1Thread1of1ForFork0_#t~nondet51#1_61|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_113|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_196|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_333|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_129|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_51|, ~#queue~0.base=|v_~#queue~0.base_152|, #pthreadsForks=|v_#pthreadsForks_152|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_333|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_53|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_96|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_152|, ~#queue~0.offset=|v_~#queue~0.offset_147|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_106|, ULTIMATE.start_main_#t~pre59#1=|v_ULTIMATE.start_main_#t~pre59#1_114|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_113|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_91|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_111|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_130|, ULTIMATE.start_main_#t~pre61#1=|v_ULTIMATE.start_main_#t~pre61#1_121|, #memory_int=|v_#memory_int_1088|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_102|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_51|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_148|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_113|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_118|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_#t~nondet51#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, ULTIMATE.start_main_#t~pre61#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, ULTIMATE.start_main_#t~nondet60#1, t1Thread1of1ForFork0_enqueue_#res#1, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, ULTIMATE.start_main_#t~pre59#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 06:14:50,536 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:14:50,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1019 [2022-12-06 06:14:50,537 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 154 transitions, 1188 flow [2022-12-06 06:14:50,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.962962962962963) internal successors, (134), 27 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:50,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:50,538 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 12, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:50,545 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-06 06:14:50,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:50,745 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1518023643, now seen corresponding path program 1 times [2022-12-06 06:14:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:50,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870466746] [2022-12-06 06:14:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870466746] [2022-12-06 06:14:51,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870466746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29351867] [2022-12-06 06:14:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:51,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:51,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:51,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:51,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:14:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:51,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 06:14:51,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:51,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:51,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29351867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:51,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:51,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2022-12-06 06:14:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463701151] [2022-12-06 06:14:51,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 06:14:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 06:14:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-12-06 06:14:51,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 06:14:51,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 154 transitions, 1188 flow. Second operand has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:51,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:51,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 06:14:51,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:52,802 INFO L130 PetriNetUnfolder]: 1270/3211 cut-off events. [2022-12-06 06:14:52,802 INFO L131 PetriNetUnfolder]: For 42377/42377 co-relation queries the response was YES. [2022-12-06 06:14:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14869 conditions, 3211 events. 1270/3211 cut-off events. For 42377/42377 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12082 event pairs, 52 based on Foata normal form. 120/3294 useless extension candidates. Maximal degree in co-relation 6754. Up to 492 conditions per place. [2022-12-06 06:14:52,835 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 452 selfloop transitions, 75 changer transitions 1/530 dead transitions. [2022-12-06 06:14:52,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 530 transitions, 6313 flow [2022-12-06 06:14:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:14:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 06:14:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 419 transitions. [2022-12-06 06:14:52,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4505376344086022 [2022-12-06 06:14:52,838 INFO L175 Difference]: Start difference. First operand has 127 places, 154 transitions, 1188 flow. Second operand 30 states and 419 transitions. [2022-12-06 06:14:52,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 530 transitions, 6313 flow [2022-12-06 06:14:52,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 530 transitions, 6093 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-12-06 06:14:52,912 INFO L231 Difference]: Finished difference. Result has 160 places, 199 transitions, 1872 flow [2022-12-06 06:14:52,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1872, PETRI_PLACES=160, PETRI_TRANSITIONS=199} [2022-12-06 06:14:52,913 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 114 predicate places. [2022-12-06 06:14:52,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:52,913 INFO L89 Accepts]: Start accepts. Operand has 160 places, 199 transitions, 1872 flow [2022-12-06 06:14:52,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:52,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:52,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 199 transitions, 1872 flow [2022-12-06 06:14:52,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 199 transitions, 1872 flow [2022-12-06 06:14:53,128 INFO L130 PetriNetUnfolder]: 245/1208 cut-off events. [2022-12-06 06:14:53,128 INFO L131 PetriNetUnfolder]: For 15915/15915 co-relation queries the response was YES. [2022-12-06 06:14:53,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 1208 events. 245/1208 cut-off events. For 15915/15915 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3669 event pairs, 0 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 4980. Up to 246 conditions per place. [2022-12-06 06:14:53,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 199 transitions, 1872 flow [2022-12-06 06:14:53,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 06:14:53,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:14:53,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 06:14:53,166 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 199 transitions, 1872 flow [2022-12-06 06:14:53,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.580645161290323) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:53,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:53,166 INFO L213 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 20, 19, 14, 14, 14, 14, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:53,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 06:14:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:53,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:14:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -510588631, now seen corresponding path program 1 times [2022-12-06 06:14:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412129619] [2022-12-06 06:14:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412129619] [2022-12-06 06:14:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412129619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242942302] [2022-12-06 06:14:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:54,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:54,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 06:14:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:55,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 06:14:55,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:55,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:14:56,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242942302] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:56,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:56,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2022-12-06 06:14:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059172617] [2022-12-06 06:14:56,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-06 06:14:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-06 06:14:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2022-12-06 06:14:56,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 06:14:56,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 199 transitions, 1872 flow. Second operand has 61 states, 61 states have (on average 7.524590163934426) internal successors, (459), 61 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:56,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:56,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 06:14:56,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:59,098 INFO L130 PetriNetUnfolder]: 2560/6543 cut-off events. [2022-12-06 06:14:59,098 INFO L131 PetriNetUnfolder]: For 155530/155530 co-relation queries the response was YES. [2022-12-06 06:14:59,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31297 conditions, 6543 events. 2560/6543 cut-off events. For 155530/155530 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 25146 event pairs, 42 based on Foata normal form. 240/6746 useless extension candidates. Maximal degree in co-relation 13800. Up to 1212 conditions per place. [2022-12-06 06:14:59,172 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 932 selfloop transitions, 165 changer transitions 0/1099 dead transitions. [2022-12-06 06:14:59,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1099 transitions, 13411 flow [2022-12-06 06:14:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-06 06:14:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-06 06:14:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 853 transitions. [2022-12-06 06:14:59,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4738888888888889 [2022-12-06 06:14:59,176 INFO L175 Difference]: Start difference. First operand has 159 places, 199 transitions, 1872 flow. Second operand 60 states and 853 transitions. [2022-12-06 06:14:59,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 1099 transitions, 13411 flow [2022-12-06 06:14:59,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1099 transitions, 13355 flow, removed 1 selfloop flow, removed 13 redundant places. [2022-12-06 06:14:59,496 INFO L231 Difference]: Finished difference. Result has 236 places, 290 transitions, 3732 flow [2022-12-06 06:14:59,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3732, PETRI_PLACES=236, PETRI_TRANSITIONS=290} [2022-12-06 06:14:59,497 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 190 predicate places. [2022-12-06 06:14:59,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:59,497 INFO L89 Accepts]: Start accepts. Operand has 236 places, 290 transitions, 3732 flow [2022-12-06 06:14:59,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:59,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:59,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 290 transitions, 3732 flow [2022-12-06 06:14:59,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 290 transitions, 3732 flow [2022-12-06 06:15:00,583 INFO L130 PetriNetUnfolder]: 515/2493 cut-off events. [2022-12-06 06:15:00,583 INFO L131 PetriNetUnfolder]: For 38593/38593 co-relation queries the response was YES. [2022-12-06 06:15:00,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12034 conditions, 2493 events. 515/2493 cut-off events. For 38593/38593 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 7665 event pairs, 0 based on Foata normal form. 0/2483 useless extension candidates. Maximal degree in co-relation 11369. Up to 606 conditions per place. [2022-12-06 06:15:00,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 290 transitions, 3732 flow [2022-12-06 06:15:00,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-06 06:15:00,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:00,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1233 [2022-12-06 06:15:00,730 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 290 transitions, 3732 flow [2022-12-06 06:15:00,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 7.524590163934426) internal successors, (459), 61 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:00,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:00,732 INFO L213 CegarLoopForPetriNet]: trace histogram [58, 58, 58, 35, 34, 29, 29, 29, 29, 29, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:00,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:00,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:00,941 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:15:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1819872576, now seen corresponding path program 2 times [2022-12-06 06:15:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:00,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457485739] [2022-12-06 06:15:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:05,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457485739] [2022-12-06 06:15:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457485739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:05,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519498027] [2022-12-06 06:15:05,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:05,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:05,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 06:15:05,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:15:05,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:05,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 06:15:05,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:06,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10078 backedges. 0 proven. 10078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:10,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519498027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:10,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:10,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2022-12-06 06:15:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671950558] [2022-12-06 06:15:10,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:10,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-12-06 06:15:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-12-06 06:15:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2022-12-06 06:15:10,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 06:15:10,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 290 transitions, 3732 flow. Second operand has 121 states, 121 states have (on average 7.512396694214876) internal successors, (909), 121 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:10,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:10,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 06:15:10,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:24,723 INFO L130 PetriNetUnfolder]: 5140/13200 cut-off events. [2022-12-06 06:15:24,723 INFO L131 PetriNetUnfolder]: For 874520/874520 co-relation queries the response was YES. [2022-12-06 06:15:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66556 conditions, 13200 events. 5140/13200 cut-off events. For 874520/874520 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 51076 event pairs, 52 based on Foata normal form. 480/13643 useless extension candidates. Maximal degree in co-relation 30921. Up to 2652 conditions per place. [2022-12-06 06:15:25,039 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 1892 selfloop transitions, 345 changer transitions 0/2239 dead transitions. [2022-12-06 06:15:25,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 2239 transitions, 28873 flow [2022-12-06 06:15:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-12-06 06:15:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-12-06 06:15:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 1723 transitions. [2022-12-06 06:15:25,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4786111111111111 [2022-12-06 06:15:25,063 INFO L175 Difference]: Start difference. First operand has 236 places, 290 transitions, 3732 flow. Second operand 120 states and 1723 transitions. [2022-12-06 06:15:25,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 2239 transitions, 28873 flow [2022-12-06 06:15:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 2239 transitions, 28733 flow, removed 1 selfloop flow, removed 27 redundant places. [2022-12-06 06:15:26,962 INFO L231 Difference]: Finished difference. Result has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:26,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=8032, PETRI_PLACES=389, PETRI_TRANSITIONS=471} [2022-12-06 06:15:26,964 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 343 predicate places. [2022-12-06 06:15:26,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:26,964 INFO L89 Accepts]: Start accepts. Operand has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:27,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:27,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:27,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:27,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:29,793 INFO L130 PetriNetUnfolder]: 1055/5098 cut-off events. [2022-12-06 06:15:29,793 INFO L131 PetriNetUnfolder]: For 99286/99286 co-relation queries the response was YES. [2022-12-06 06:15:29,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26105 conditions, 5098 events. 1055/5098 cut-off events. For 99286/99286 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 16073 event pairs, 0 based on Foata normal form. 0/5088 useless extension candidates. Maximal degree in co-relation 25111. Up to 1326 conditions per place. [2022-12-06 06:15:29,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:29,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 1980 [2022-12-06 06:15:30,046 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:30,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3083 [2022-12-06 06:15:30,047 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 471 transitions, 8032 flow [2022-12-06 06:15:30,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 7.512396694214876) internal successors, (909), 121 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:30,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:30,048 INFO L213 CegarLoopForPetriNet]: trace histogram [118, 118, 118, 65, 64, 59, 59, 59, 59, 59, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:30,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:30,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:30,265 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:15:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1259018706, now seen corresponding path program 3 times [2022-12-06 06:15:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:30,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874240758] [2022-12-06 06:15:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 41728 backedges. 0 proven. 41728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:46,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:46,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874240758] [2022-12-06 06:15:46,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874240758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:46,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015357725] [2022-12-06 06:15:46,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 06:15:46,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:46,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:46,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 06:15:49,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-06 06:15:49,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:49,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 06:15:49,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:49,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-12-06 06:15:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:15:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:15:49,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-06 06:15:49,749 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-12-06 06:15:49,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-12-06 06:15:49,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 06:15:49,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:15:49,941 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 06:15:49,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 06:15:50,034 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 23 treesize of output 22 [2022-12-06 06:15:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 41728 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 41260 trivial. 0 not checked. [2022-12-06 06:15:50,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:15:50,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015357725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:50,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:15:50,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [121] total 124 [2022-12-06 06:15:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371127784] [2022-12-06 06:15:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:50,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:15:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:15:50,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=7985, Unknown=0, NotChecked=0, Total=15252 [2022-12-06 06:15:50,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:15:50,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 471 transitions, 8032 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:50,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:50,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:15:50,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:00,951 INFO L130 PetriNetUnfolder]: 6527/14565 cut-off events. [2022-12-06 06:16:00,951 INFO L131 PetriNetUnfolder]: For 200667/200667 co-relation queries the response was YES. [2022-12-06 06:16:01,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75322 conditions, 14565 events. 6527/14565 cut-off events. For 200667/200667 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 52163 event pairs, 32 based on Foata normal form. 3/14531 useless extension candidates. Maximal degree in co-relation 72996. Up to 14523 conditions per place. [2022-12-06 06:16:01,280 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 468 selfloop transitions, 8 changer transitions 0/476 dead transitions. [2022-12-06 06:16:01,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 476 transitions, 9029 flow [2022-12-06 06:16:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:16:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:16:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 06:16:01,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2022-12-06 06:16:01,283 INFO L175 Difference]: Start difference. First operand has 389 places, 471 transitions, 8032 flow. Second operand 5 states and 43 transitions. [2022-12-06 06:16:01,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 476 transitions, 9029 flow [2022-12-06 06:16:05,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 476 transitions, 8698 flow, removed 6 selfloop flow, removed 59 redundant places. [2022-12-06 06:16:05,171 INFO L231 Difference]: Finished difference. Result has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:05,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7674, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7757, PETRI_PLACES=335, PETRI_TRANSITIONS=468} [2022-12-06 06:16:05,173 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 289 predicate places. [2022-12-06 06:16:05,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:05,174 INFO L89 Accepts]: Start accepts. Operand has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:05,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:05,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:05,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:05,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:08,674 INFO L130 PetriNetUnfolder]: 1054/5063 cut-off events. [2022-12-06 06:16:08,674 INFO L131 PetriNetUnfolder]: For 97466/97466 co-relation queries the response was YES. [2022-12-06 06:16:08,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25690 conditions, 5063 events. 1054/5063 cut-off events. For 97466/97466 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 15727 event pairs, 0 based on Foata normal form. 0/5053 useless extension candidates. Maximal degree in co-relation 24695. Up to 1325 conditions per place. [2022-12-06 06:16:08,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:08,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 1968 [2022-12-06 06:16:08,871 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:08,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3699 [2022-12-06 06:16:08,872 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 468 transitions, 7757 flow [2022-12-06 06:16:08,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:08,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:08,872 INFO L213 CegarLoopForPetriNet]: trace histogram [118, 118, 118, 66, 65, 59, 59, 59, 59, 59, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:08,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 06:16:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:09,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:16:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1467633432, now seen corresponding path program 4 times [2022-12-06 06:16:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304274152] [2022-12-06 06:16:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304274152] [2022-12-06 06:16:22,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304274152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:16:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181851507] [2022-12-06 06:16:22,864 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 06:16:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:16:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:22,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:16:22,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 06:16:25,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 06:16:25,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:16:25,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 6080 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-06 06:16:25,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:16:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:26,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:16:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 41793 backedges. 0 proven. 41793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:37,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181851507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:16:37,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:16:37,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 241 [2022-12-06 06:16:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170745304] [2022-12-06 06:16:37,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:16:37,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 241 states [2022-12-06 06:16:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2022-12-06 06:16:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2022-12-06 06:16:37,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 06:16:37,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 468 transitions, 7757 flow. Second operand has 241 states, 241 states have (on average 7.514522821576763) internal successors, (1811), 241 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:37,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:37,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 06:16:37,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:19,418 INFO L130 PetriNetUnfolder]: 10283/26479 cut-off events. [2022-12-06 06:18:19,418 INFO L131 PetriNetUnfolder]: For 6564247/6564247 co-relation queries the response was YES. [2022-12-06 06:18:20,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139665 conditions, 26479 events. 10283/26479 cut-off events. For 6564247/6564247 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 103024 event pairs, 38 based on Foata normal form. 960/27402 useless extension candidates. Maximal degree in co-relation 66112. Up to 5529 conditions per place. [2022-12-06 06:18:20,602 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 3807 selfloop transitions, 704 changer transitions 0/4513 dead transitions. [2022-12-06 06:18:20,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 4513 transitions, 61100 flow [2022-12-06 06:18:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2022-12-06 06:18:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2022-12-06 06:18:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 3461 transitions. [2022-12-06 06:18:20,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4806944444444444 [2022-12-06 06:18:20,623 INFO L175 Difference]: Start difference. First operand has 335 places, 468 transitions, 7757 flow. Second operand 240 states and 3461 transitions. [2022-12-06 06:18:20,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 4513 transitions, 61100 flow [2022-12-06 06:18:32,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 4513 transitions, 59627 flow, removed 733 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:32,750 INFO L231 Difference]: Finished difference. Result has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:32,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=7700, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=240, PETRI_FLOW=17782, PETRI_PLACES=693, PETRI_TRANSITIONS=829} [2022-12-06 06:18:32,752 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 647 predicate places. [2022-12-06 06:18:32,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:32,752 INFO L89 Accepts]: Start accepts. Operand has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:33,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:33,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:33,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:48,559 INFO L130 PetriNetUnfolder]: 2134/10223 cut-off events. [2022-12-06 06:18:48,560 INFO L131 PetriNetUnfolder]: For 257454/257454 co-relation queries the response was YES. [2022-12-06 06:18:48,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54213 conditions, 10223 events. 2134/10223 cut-off events. For 257454/257454 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 32330 event pairs, 0 based on Foata normal form. 0/10213 useless extension candidates. Maximal degree in co-relation 52596. Up to 2764 conditions per place. [2022-12-06 06:18:48,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:48,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 3412 [2022-12-06 06:18:49,370 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:49,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16619 [2022-12-06 06:18:49,371 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 829 transitions, 17782 flow [2022-12-06 06:18:49,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 241 states, 241 states have (on average 7.514522821576763) internal successors, (1811), 241 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:49,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:49,372 INFO L213 CegarLoopForPetriNet]: trace histogram [238, 238, 238, 125, 124, 120, 120, 120, 118, 118, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:49,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 06:18:49,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 06:18:49,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -565807535, now seen corresponding path program 5 times [2022-12-06 06:18:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563061766] [2022-12-06 06:18:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 169948 backedges. 0 proven. 169948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563061766] [2022-12-06 06:20:09,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563061766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:20:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888355047] [2022-12-06 06:20:09,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 06:20:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:09,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:20:09,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 06:20:11,192 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-06 06:20:11,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:20:11,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 103 conjunts are in the unsatisfiable core [2022-12-06 06:20:11,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:20:11,367 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 13 treesize of output 9 [2022-12-06 06:20:11,493 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-06 06:20:11,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 25 treesize of output 38 [2022-12-06 06:20:11,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:20:11,696 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-06 06:20:11,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2022-12-06 06:20:11,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:11,937 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 48 treesize of output 47 [2022-12-06 06:20:12,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 40 [2022-12-06 06:20:12,347 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-12-06 06:20:12,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 51 treesize of output 64 [2022-12-06 06:20:12,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:20:12,766 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-06 06:20:12,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2022-12-06 06:20:12,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:12,949 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 48 treesize of output 47 [2022-12-06 06:20:13,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 13 [2022-12-06 06:20:13,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:13,299 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 25 treesize of output 24 [2022-12-06 06:20:13,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:20:13,496 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-06 06:20:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-06 06:20:13,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:13,672 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 23 treesize of output 22 [2022-12-06 06:20:13,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-06 06:20:13,997 INFO L321 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2022-12-06 06:20:13,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 31 treesize of output 30 [2022-12-06 06:20:14,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:20:14,229 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-06 06:20:14,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-06 06:20:14,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:14,344 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 23 treesize of output 22 [2022-12-06 06:20:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 169948 backedges. 41798 proven. 15 refuted. 0 times theorem prover too weak. 128135 trivial. 0 not checked. [2022-12-06 06:20:14,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-06 06:28:44,079 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-06 06:28:44,106 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:28:45,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 06:28:45,279 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 06:28:45,293 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:28:45,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:28:45,294 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 1682 with TraceHistMax 238,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-12-06 06:28:45,295 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:28:45,295 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:28:45,295 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:28:45,295 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:28:45,295 INFO L458 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1] [2022-12-06 06:28:45,298 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:28:45,298 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:28:45,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:28:45 BasicIcfg [2022-12-06 06:28:45,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:28:45,301 INFO L158 Benchmark]: Toolchain (without parser) took 853804.98ms. Allocated memory was 208.7MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 181.6MB in the beginning and 514.8MB in the end (delta: -333.2MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 06:28:45,301 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory was 185.0MB in the beginning and 184.9MB in the end (delta: 62.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:28:45,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.04ms. Allocated memory is still 208.7MB. Free memory was 181.1MB in the beginning and 150.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 06:28:45,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.45ms. Allocated memory is still 208.7MB. Free memory was 150.7MB in the beginning and 148.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:45,301 INFO L158 Benchmark]: Boogie Preprocessor took 53.81ms. Allocated memory is still 208.7MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:45,301 INFO L158 Benchmark]: RCFGBuilder took 596.28ms. Allocated memory is still 208.7MB. Free memory was 145.9MB in the beginning and 124.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 06:28:45,302 INFO L158 Benchmark]: TraceAbstraction took 852634.50ms. Allocated memory was 208.7MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 123.9MB in the beginning and 514.8MB in the end (delta: -390.9MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 06:28:45,302 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory was 185.0MB in the beginning and 184.9MB in the end (delta: 62.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.04ms. Allocated memory is still 208.7MB. Free memory was 181.1MB in the beginning and 150.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.45ms. Allocated memory is still 208.7MB. Free memory was 150.7MB in the beginning and 148.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.81ms. Allocated memory is still 208.7MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.28ms. Allocated memory is still 208.7MB. Free memory was 145.9MB in the beginning and 124.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 852634.50ms. Allocated memory was 208.7MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 123.9MB in the beginning and 514.8MB in the end (delta: -390.9MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 198 PlacesBefore, 46 PlacesAfterwards, 204 TransitionsBefore, 47 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 5 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 6649, independent unconditional: 0, dependent: 206, dependent conditional: 206, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6855, independent: 6649, independent conditional: 0, independent unconditional: 6649, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5796, independent: 5695, independent conditional: 0, independent unconditional: 5695, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5796, independent: 5681, independent conditional: 0, independent unconditional: 5681, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6855, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 5796, unknown conditional: 0, unknown unconditional: 5796] , Statistics on independence cache: Total cache size (in pairs): 9610, Positive cache size: 9509, Positive conditional cache size: 0, Positive unconditional cache size: 9509, Negative cache size: 101, Negative conditional cache size: 0, Negative unconditional cache size: 101, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 204, independent conditional: 0, independent unconditional: 204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 41 PlacesBefore, 32 PlacesAfterwards, 39 TransitionsBefore, 30 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 62, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, 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, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 66, Negative conditional cache size: 1, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 129 PlacesBefore, 127 PlacesAfterwards, 156 TransitionsBefore, 154 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 45, independent conditional: 37, independent unconditional: 8, dependent: 47, dependent conditional: 39, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 45, independent conditional: 34, independent unconditional: 11, dependent: 49, dependent conditional: 39, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 45, independent conditional: 34, independent unconditional: 11, dependent: 49, dependent conditional: 39, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 35, dependent conditional: 25, dependent unconditional: 10, unknown: 35, unknown conditional: 34, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 81, Negative conditional cache size: 16, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 159 PlacesBefore, 159 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 90, Negative conditional cache size: 25, Negative unconditional cache size: 65, 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.1s, 236 PlacesBefore, 236 PlacesAfterwards, 290 TransitionsBefore, 290 TransitionsAfterwards, 1256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 91, Negative conditional cache size: 26, Negative unconditional cache size: 65, 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.1s, 389 PlacesBefore, 389 PlacesAfterwards, 471 TransitionsBefore, 471 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, 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: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 313, Positive conditional cache size: 20, Positive unconditional cache size: 293, Negative cache size: 91, Negative conditional cache size: 26, Negative unconditional cache size: 65, 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.1s, 335 PlacesBefore, 335 PlacesAfterwards, 468 TransitionsBefore, 468 TransitionsAfterwards, 1968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 25, dependent conditional: 21, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 15, unknown conditional: 14, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 316, Positive conditional cache size: 22, Positive unconditional cache size: 294, Negative cache size: 103, Negative conditional cache size: 38, Negative unconditional cache size: 65, 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.4s, 693 PlacesBefore, 693 PlacesAfterwards, 829 TransitionsBefore, 829 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 26, dependent conditional: 22, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 28, dependent conditional: 23, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 28, dependent conditional: 23, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 22, dependent conditional: 17, dependent unconditional: 5, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 318, Positive conditional cache size: 24, Positive unconditional cache size: 294, Negative cache size: 109, Negative conditional cache size: 44, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 1682 with TraceHistMax 238,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 1682 with TraceHistMax 238,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: 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 1682 with TraceHistMax 238,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: 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 1682 with TraceHistMax 238,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 locations, 5 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: 852.4s, OverallIterations: 13, TraceHistogramMax: 238, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 155.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17040 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17040 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 63 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6818 IncrementalHoareTripleChecker+Invalid, 10227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3346 mSolverCounterUnsat, 1 mSDtfsCounter, 6818 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4687 GetRequests, 4017 SyntacticMatches, 13 SemanticMatches, 657 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17782occurred in iteration=12, InterpolantAutomatonStates: 532, 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.9s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 53.6s InterpolantComputationTime, 5139 NumberOfCodeBlocks, 4293 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6823 ConstructedInterpolants, 3 QuantifiedInterpolants, 19441 SizeOfPredicates, 27 NumberOfNonLiveVariables, 13304 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 42252/248801 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 [2022-12-06 06:28:45,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown