/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:46:28,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:46:28,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:46:28,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:46:28,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:46:28,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:46:28,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:46:28,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:46:28,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:46:28,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:46:28,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:46:28,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:46:28,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:46:28,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:46:28,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:46:28,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:46:28,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:46:28,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:46:28,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:46:28,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:46:28,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:46:28,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:46:28,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:46:28,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:46:28,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:46:28,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:46:28,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:46:28,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:46:28,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:46:28,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:46:28,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:46:28,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:46:28,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:46:28,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:46:28,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:46:28,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:46:28,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:46:28,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:46:28,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:46:28,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:46:28,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:46:28,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:46:28,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:46:28,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:46:28,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:46:28,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:46:28,493 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:46:28,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:46:28,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:46:28,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:46:28,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:46:28,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:46:28,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:46:28,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:46:28,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:46:28,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:46:28,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:46:28,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:46:28,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:46:28,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:46:28,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:46:28,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:46:28,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:46:28,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:46:28,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 02:46:28,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:46:28,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:46:28,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:46:28,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:46:28,857 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:46:28,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-13 02:46:30,036 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:46:30,296 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:46:30,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-13 02:46:30,318 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be2ba391/d6a1be8e8d3942bca83b7d086bb66ce5/FLAGccd7ffbd3 [2022-12-13 02:46:30,331 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be2ba391/d6a1be8e8d3942bca83b7d086bb66ce5 [2022-12-13 02:46:30,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:46:30,335 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:46:30,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:46:30,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:46:30,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:46:30,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:30,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70792efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30, skipping insertion in model container [2022-12-13 02:46:30,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:30,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:46:30,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:46:30,849 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_longest.i[43280,43293] [2022-12-13 02:46:30,857 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_longest.i[43553,43566] [2022-12-13 02:46:30,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:46:30,874 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:46:30,921 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_longest.i[43280,43293] [2022-12-13 02:46:30,923 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_longest.i[43553,43566] [2022-12-13 02:46:30,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:46:30,986 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:46:30,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30 WrapperNode [2022-12-13 02:46:30,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:46:30,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:46:30,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:46:30,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:46:30,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,058 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-13 02:46:31,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:46:31,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:46:31,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:46:31,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:46:31,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,112 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:46:31,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:46:31,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:46:31,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:46:31,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (1/1) ... [2022-12-13 02:46:31,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:46:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:31,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 02:46:31,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 02:46:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 02:46:31,194 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 02:46:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 02:46:31,195 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:46:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:46:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:46:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:46:31,197 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:46:31,365 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:46:31,367 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:46:31,684 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:46:31,692 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:46:31,693 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 02:46:31,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:46:31 BoogieIcfgContainer [2022-12-13 02:46:31,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:46:31,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:46:31,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:46:31,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:46:31,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:46:30" (1/3) ... [2022-12-13 02:46:31,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f35ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:46:31, skipping insertion in model container [2022-12-13 02:46:31,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:46:30" (2/3) ... [2022-12-13 02:46:31,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f35ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:46:31, skipping insertion in model container [2022-12-13 02:46:31,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:46:31" (3/3) ... [2022-12-13 02:46:31,707 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 02:46:31,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:46:31,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 02:46:31,724 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:46:31,823 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:46:31,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-13 02:46:31,969 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-13 02:46:31,970 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:46:31,978 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-13 02:46:31,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-13 02:46:31,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-13 02:46:31,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:32,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-13 02:46:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 417 flow [2022-12-13 02:46:32,092 INFO L130 PetriNetUnfolder]: 13/204 cut-off events. [2022-12-13 02:46:32,093 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:46:32,098 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-13 02:46:32,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 204 transitions, 417 flow [2022-12-13 02:46:32,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 9810 [2022-12-13 02:46:41,519 INFO L241 LiptonReduction]: Total number of compositions: 167 [2022-12-13 02:46:41,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:46:41,552 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;@1c718dfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:46:41,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 02:46:41,554 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 02:46:41,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:46:41,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:41,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 02:46:41,555 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-13 02:46:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 880, now seen corresponding path program 1 times [2022-12-13 02:46:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:41,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023913730] [2022-12-13 02:46:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:41,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:41,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023913730] [2022-12-13 02:46:41,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023913730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:41,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:41,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 02:46:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610573520] [2022-12-13 02:46:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:41,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 02:46:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 02:46:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 02:46:41,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 82 [2022-12-13 02:46:41,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 173 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:41,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:41,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 82 [2022-12-13 02:46:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:42,268 INFO L130 PetriNetUnfolder]: 3558/5821 cut-off events. [2022-12-13 02:46:42,269 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 02:46:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11288 conditions, 5821 events. 3558/5821 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 33901 event pairs, 2900 based on Foata normal form. 0/3129 useless extension candidates. Maximal degree in co-relation 11124. Up to 5369 conditions per place. [2022-12-13 02:46:42,303 INFO L137 encePairwiseOnDemand]: 80/82 looper letters, 65 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2022-12-13 02:46:42,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 02:46:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 02:46:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-12-13 02:46:42,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2022-12-13 02:46:42,322 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 0 predicate places. [2022-12-13 02:46:42,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:42,376 INFO L89 Accepts]: Start accepts. Operand has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:42,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:42,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 02:46:42,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:42,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 02:46:42,454 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 299 flow [2022-12-13 02:46:42,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:42,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:42,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:42,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:46:42,455 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-13 02:46:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1562134785, now seen corresponding path program 1 times [2022-12-13 02:46:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278115863] [2022-12-13 02:46:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278115863] [2022-12-13 02:46:42,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278115863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:42,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:42,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:46:42,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338736789] [2022-12-13 02:46:42,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:42,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:46:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:46:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:46:42,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 80 [2022-12-13 02:46:42,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:42,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:42,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 80 [2022-12-13 02:46:42,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:42,980 INFO L130 PetriNetUnfolder]: 1015/1878 cut-off events. [2022-12-13 02:46:42,980 INFO L131 PetriNetUnfolder]: For 162/168 co-relation queries the response was YES. [2022-12-13 02:46:42,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 1878 events. 1015/1878 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10307 event pairs, 820 based on Foata normal form. 119/1166 useless extension candidates. Maximal degree in co-relation 5169. Up to 1725 conditions per place. [2022-12-13 02:46:42,985 INFO L137 encePairwiseOnDemand]: 76/80 looper letters, 38 selfloop transitions, 2 changer transitions 38/91 dead transitions. [2022-12-13 02:46:42,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 503 flow [2022-12-13 02:46:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:46:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:46:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-12-13 02:46:42,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 02:46:42,988 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2022-12-13 02:46:42,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 91 transitions, 503 flow [2022-12-13 02:46:42,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 276 flow [2022-12-13 02:46:43,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:43,001 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 276 flow [2022-12-13 02:46:43,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:43,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:43,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 276 flow [2022-12-13 02:46:43,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 276 flow [2022-12-13 02:46:43,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 02:46:43,252 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:46:43,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 02:46:43,254 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 274 flow [2022-12-13 02:46:43,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:43,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:43,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:46:43,254 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-13 02:46:43,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1524891937, now seen corresponding path program 1 times [2022-12-13 02:46:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:43,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886751284] [2022-12-13 02:46:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886751284] [2022-12-13 02:46:43,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886751284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:43,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:43,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:46:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305516117] [2022-12-13 02:46:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:43,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:46:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:46:43,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:46:43,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2022-12-13 02:46:43,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:43,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2022-12-13 02:46:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:43,485 INFO L130 PetriNetUnfolder]: 372/769 cut-off events. [2022-12-13 02:46:43,486 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-12-13 02:46:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 769 events. 372/769 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3310 event pairs, 163 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 2480. Up to 624 conditions per place. [2022-12-13 02:46:43,491 INFO L137 encePairwiseOnDemand]: 45/48 looper letters, 49 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2022-12-13 02:46:43,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 457 flow [2022-12-13 02:46:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:46:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:46:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 02:46:43,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 02:46:43,497 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -27 predicate places. [2022-12-13 02:46:43,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 65 transitions, 457 flow [2022-12-13 02:46:43,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 63 transitions, 449 flow [2022-12-13 02:46:43,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:43,506 INFO L89 Accepts]: Start accepts. Operand has 53 places, 63 transitions, 449 flow [2022-12-13 02:46:43,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:43,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:43,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 63 transitions, 449 flow [2022-12-13 02:46:43,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 63 transitions, 449 flow [2022-12-13 02:46:43,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 02:46:43,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:43,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 02:46:43,577 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 63 transitions, 449 flow [2022-12-13 02:46:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:43,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:46:43,577 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-13 02:46:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1777852052, now seen corresponding path program 1 times [2022-12-13 02:46:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:43,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194524445] [2022-12-13 02:46:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194524445] [2022-12-13 02:46:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194524445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:46:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912801541] [2022-12-13 02:46:43,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:43,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:43,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:43,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:46:43,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 02:46:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:43,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 02:46:43,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:46:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:43,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:46:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:43,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912801541] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:46:43,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:46:43,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 02:46:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847876085] [2022-12-13 02:46:43,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:46:43,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:46:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:43,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:46:43,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:46:43,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 02:46:43,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 63 transitions, 449 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:43,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 02:46:43,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:44,119 INFO L130 PetriNetUnfolder]: 487/1069 cut-off events. [2022-12-13 02:46:44,119 INFO L131 PetriNetUnfolder]: For 790/790 co-relation queries the response was YES. [2022-12-13 02:46:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1069 events. 487/1069 cut-off events. For 790/790 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4309 event pairs, 109 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 4231. Up to 843 conditions per place. [2022-12-13 02:46:44,127 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 75 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2022-12-13 02:46:44,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:46:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:46:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-13 02:46:44,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2022-12-13 02:46:44,130 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -23 predicate places. [2022-12-13 02:46:44,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:44,143 INFO L89 Accepts]: Start accepts. Operand has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:44,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:44,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 02:46:44,155 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:44,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 02:46:44,156 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 93 transitions, 860 flow [2022-12-13 02:46:44,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:44,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:44,156 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:44,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 02:46:44,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:44,364 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-13 02:46:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1700051833, now seen corresponding path program 1 times [2022-12-13 02:46:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:44,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709158571] [2022-12-13 02:46:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 02:46:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:44,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709158571] [2022-12-13 02:46:44,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709158571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:44,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:44,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:46:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251271900] [2022-12-13 02:46:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:46:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:46:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:46:44,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2022-12-13 02:46:44,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 93 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:44,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:44,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2022-12-13 02:46:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:44,778 INFO L130 PetriNetUnfolder]: 264/674 cut-off events. [2022-12-13 02:46:44,778 INFO L131 PetriNetUnfolder]: For 930/930 co-relation queries the response was YES. [2022-12-13 02:46:44,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 674 events. 264/674 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2516 event pairs, 0 based on Foata normal form. 87/635 useless extension candidates. Maximal degree in co-relation 3095. Up to 531 conditions per place. [2022-12-13 02:46:44,782 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 81 selfloop transitions, 5 changer transitions 2/98 dead transitions. [2022-12-13 02:46:44,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 1093 flow [2022-12-13 02:46:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:46:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:46:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 02:46:44,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2022-12-13 02:46:44,787 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -21 predicate places. [2022-12-13 02:46:44,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 98 transitions, 1093 flow [2022-12-13 02:46:44,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 96 transitions, 1079 flow [2022-12-13 02:46:44,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:44,796 INFO L89 Accepts]: Start accepts. Operand has 58 places, 96 transitions, 1079 flow [2022-12-13 02:46:44,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:44,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:44,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 96 transitions, 1079 flow [2022-12-13 02:46:44,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 96 transitions, 1079 flow [2022-12-13 02:46:44,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-13 02:46:44,806 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:44,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 02:46:44,807 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 96 transitions, 1079 flow [2022-12-13 02:46:44,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:44,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:44,808 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:44,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:46:44,808 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-13 02:46:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash 399273241, now seen corresponding path program 1 times [2022-12-13 02:46:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:44,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256003252] [2022-12-13 02:46:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:44,960 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-13 02:46:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:44,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256003252] [2022-12-13 02:46:44,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256003252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:46:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854050949] [2022-12-13 02:46:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:44,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:46:44,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 02:46:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:45,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:46:45,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:46:45,200 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-13 02:46:45,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:46:45,278 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-13 02:46:45,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854050949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:46:45,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:46:45,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 02:46:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452267672] [2022-12-13 02:46:45,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:46:45,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:46:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:45,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:46:45,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:46:45,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 02:46:45,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 96 transitions, 1079 flow. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:45,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:45,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 02:46:45,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:45,644 INFO L130 PetriNetUnfolder]: 436/1202 cut-off events. [2022-12-13 02:46:45,644 INFO L131 PetriNetUnfolder]: For 2708/2708 co-relation queries the response was YES. [2022-12-13 02:46:45,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6644 conditions, 1202 events. 436/1202 cut-off events. For 2708/2708 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4573 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 6269. Up to 880 conditions per place. [2022-12-13 02:46:45,652 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 163 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2022-12-13 02:46:45,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:46:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:46:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2022-12-13 02:46:45,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 02:46:45,656 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, -12 predicate places. [2022-12-13 02:46:45,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:45,677 INFO L89 Accepts]: Start accepts. Operand has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:45,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:45,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 02:46:45,709 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:45,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 02:46:45,716 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 186 transitions, 2545 flow [2022-12-13 02:46:45,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 13 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:45,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:45,719 INFO L214 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:45,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 02:46:45,925 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-13 02:46:45,926 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-13 02:46:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1358244953, now seen corresponding path program 2 times [2022-12-13 02:46:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:45,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342511732] [2022-12-13 02:46:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:46,321 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-13 02:46:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:46,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342511732] [2022-12-13 02:46:46,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342511732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:46:46,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578748263] [2022-12-13 02:46:46,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:46:46,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:46,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:46,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:46:46,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 02:46:46,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:46:46,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:46:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 02:46:46,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:46:46,691 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-13 02:46:46,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:46:46,941 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-13 02:46:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578748263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:46:46,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:46:46,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-13 02:46:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323448401] [2022-12-13 02:46:46,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:46:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 02:46:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 02:46:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-12-13 02:46:46,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 02:46:46,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 186 transitions, 2545 flow. Second operand has 25 states, 25 states have (on average 16.0) internal successors, (400), 25 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:46,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:46,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 02:46:46,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:47,673 INFO L130 PetriNetUnfolder]: 784/2270 cut-off events. [2022-12-13 02:46:47,673 INFO L131 PetriNetUnfolder]: For 7607/7607 co-relation queries the response was YES. [2022-12-13 02:46:47,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13692 conditions, 2270 events. 784/2270 cut-off events. For 7607/7607 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8764 event pairs, 0 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 13266. Up to 1588 conditions per place. [2022-12-13 02:46:47,688 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 331 selfloop transitions, 24 changer transitions 0/366 dead transitions. [2022-12-13 02:46:47,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 02:46:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 02:46:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 545 transitions. [2022-12-13 02:46:47,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5160984848484849 [2022-12-13 02:46:47,692 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 11 predicate places. [2022-12-13 02:46:47,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:47,737 INFO L89 Accepts]: Start accepts. Operand has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:47,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:47,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 02:46:47,807 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:47,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 02:46:47,808 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 366 transitions, 5847 flow [2022-12-13 02:46:47,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.0) internal successors, (400), 25 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:47,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:47,809 INFO L214 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:47,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 02:46:48,017 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-13 02:46:48,017 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-13 02:46:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash -550810132, now seen corresponding path program 1 times [2022-12-13 02:46:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:48,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627130129] [2022-12-13 02:46:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627130129] [2022-12-13 02:46:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627130129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:46:49,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080146570] [2022-12-13 02:46:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:49,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:49,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:46:49,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 02:46:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:49,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:46:49,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:46:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:49,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:46:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080146570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:46:50,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:46:50,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-12-13 02:46:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722976066] [2022-12-13 02:46:50,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:46:50,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 02:46:50,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:50,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 02:46:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 02:46:50,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 02:46:50,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 366 transitions, 5847 flow. Second operand has 49 states, 49 states have (on average 15.979591836734693) internal successors, (783), 49 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:50,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:50,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 02:46:50,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:52,459 INFO L130 PetriNetUnfolder]: 1480/4406 cut-off events. [2022-12-13 02:46:52,460 INFO L131 PetriNetUnfolder]: For 20313/20313 co-relation queries the response was YES. [2022-12-13 02:46:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29032 conditions, 4406 events. 1480/4406 cut-off events. For 20313/20313 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 17198 event pairs, 0 based on Foata normal form. 0/3819 useless extension candidates. Maximal degree in co-relation 28555. Up to 3004 conditions per place. [2022-12-13 02:46:52,493 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 667 selfloop transitions, 48 changer transitions 0/726 dead transitions. [2022-12-13 02:46:52,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 02:46:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-13 02:46:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1085 transitions. [2022-12-13 02:46:52,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5137310606060606 [2022-12-13 02:46:52,539 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 58 predicate places. [2022-12-13 02:46:52,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:52,656 INFO L89 Accepts]: Start accepts. Operand has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:52,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:52,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 2944 [2022-12-13 02:46:52,907 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:46:52,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 02:46:52,909 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 726 transitions, 13181 flow [2022-12-13 02:46:52,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 15.979591836734693) internal successors, (783), 49 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:52,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:52,911 INFO L214 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:52,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 02:46:53,119 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-13 02:46:53,120 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-13 02:46:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1302681561, now seen corresponding path program 3 times [2022-12-13 02:46:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:53,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678339500] [2022-12-13 02:46:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 7291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678339500] [2022-12-13 02:46:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678339500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:46:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853032035] [2022-12-13 02:46:56,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 02:46:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:46:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:46:56,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:46:56,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 02:46:57,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 02:46:57,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:46:57,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 02:46:57,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:46:58,572 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-13 02:46:58,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:46:58,619 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-13 02:46:58,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:46:58,726 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 02:46:58,727 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-13 02:46:58,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:46:58,780 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-13 02:46:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 400 proven. 225 refuted. 0 times theorem prover too weak. 6666 trivial. 0 not checked. [2022-12-13 02:46:58,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:46:59,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1833 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1832) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_160| 4) |c_~#queue~0.offset|) v_ArrVal_1833) .cse1) 800))))) is different from false [2022-12-13 02:46:59,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:46:59,016 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 54 treesize of output 44 [2022-12-13 02:46:59,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:46:59,028 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 81 treesize of output 83 [2022-12-13 02:46:59,044 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 78 treesize of output 70 [2022-12-13 02:46:59,062 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-13 02:46:59,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:46:59,117 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 52 treesize of output 48 [2022-12-13 02:46:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 356 proven. 225 refuted. 0 times theorem prover too weak. 6666 trivial. 44 not checked. [2022-12-13 02:46:59,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853032035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:46:59,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:46:59,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 7, 7] total 61 [2022-12-13 02:46:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793668472] [2022-12-13 02:46:59,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:46:59,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-13 02:46:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-13 02:46:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=2324, Unknown=1, NotChecked=116, Total=3660 [2022-12-13 02:46:59,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-13 02:46:59,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 726 transitions, 13181 flow. Second operand has 61 states, 61 states have (on average 11.442622950819672) internal successors, (698), 61 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:59,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:59,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-13 02:46:59,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:47:16,120 INFO L130 PetriNetUnfolder]: 4752/10951 cut-off events. [2022-12-13 02:47:16,120 INFO L131 PetriNetUnfolder]: For 85230/85230 co-relation queries the response was YES. [2022-12-13 02:47:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87594 conditions, 10951 events. 4752/10951 cut-off events. For 85230/85230 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 50448 event pairs, 0 based on Foata normal form. 0/9490 useless extension candidates. Maximal degree in co-relation 86751. Up to 8004 conditions per place. [2022-12-13 02:47:16,188 INFO L137 encePairwiseOnDemand]: 32/44 looper letters, 1567 selfloop transitions, 578 changer transitions 192/2342 dead transitions. [2022-12-13 02:47:16,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 2342 transitions, 39915 flow [2022-12-13 02:47:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-12-13 02:47:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2022-12-13 02:47:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 3006 transitions. [2022-12-13 02:47:16,198 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3433074463225217 [2022-12-13 02:47:16,199 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 256 predicate places. [2022-12-13 02:47:16,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 2342 transitions, 39915 flow [2022-12-13 02:47:16,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 2150 transitions, 39147 flow [2022-12-13 02:47:16,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:47:16,719 INFO L89 Accepts]: Start accepts. Operand has 335 places, 2150 transitions, 39147 flow [2022-12-13 02:47:16,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:47:16,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:47:16,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 335 places, 2150 transitions, 39147 flow [2022-12-13 02:47:17,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 2150 transitions, 39147 flow [2022-12-13 02:47:17,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 2782 [2022-12-13 02:47:17,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L1008-1-->L1011-5: Formula: (and (= |v_t1Thread1of1ForFork0_~i~0#1_51| 0) (not (= 0 (mod v_~enqueue_flag~0_51 256)))) InVars {~enqueue_flag~0=v_~enqueue_flag~0_51} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_51|, ~enqueue_flag~0=v_~enqueue_flag~0_51, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_17|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_#t~nondet49#1] and [768] 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_401| |v_ULTIMATE.start_main_~#id2~0#1.base_23| (store (select |v_#memory_int_401| |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_400|)) 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_401|, 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_400|, 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] [2022-12-13 02:47:17,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:47:17,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 563 [2022-12-13 02:47:17,281 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 2149 transitions, 39129 flow [2022-12-13 02:47:17,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 11.442622950819672) internal successors, (698), 61 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:47:17,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:47:17,282 INFO L214 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:47:17,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 02:47:17,492 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-13 02:47:17,492 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-13 02:47:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:47:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash 571824727, now seen corresponding path program 1 times [2022-12-13 02:47:17,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:47:17,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400321996] [2022-12-13 02:47:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:47:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:47:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:47:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:47:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:47:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400321996] [2022-12-13 02:47:20,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400321996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:47:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324734673] [2022-12-13 02:47:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:47:20,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:47:20,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:47:20,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:47:20,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 02:47:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:47:21,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2386 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 02:47:21,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:47:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:47:21,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:47:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:47:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324734673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:47:23,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:47:23,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2022-12-13 02:47:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950085602] [2022-12-13 02:47:23,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:47:23,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-12-13 02:47:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:47:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-12-13 02:47:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2022-12-13 02:47:23,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2022-12-13 02:47:23,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 2149 transitions, 39129 flow. Second operand has 99 states, 99 states have (on average 14.464646464646465) internal successors, (1432), 99 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:47:23,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:47:23,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2022-12-13 02:47:23,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:47:36,807 INFO L130 PetriNetUnfolder]: 7794/18094 cut-off events. [2022-12-13 02:47:36,807 INFO L131 PetriNetUnfolder]: For 158164/158164 co-relation queries the response was YES. [2022-12-13 02:47:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165864 conditions, 18094 events. 7794/18094 cut-off events. For 158164/158164 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 77890 event pairs, 0 based on Foata normal form. 0/15669 useless extension candidates. Maximal degree in co-relation 164940. Up to 14127 conditions per place. [2022-12-13 02:47:36,937 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 3491 selfloop transitions, 197 changer transitions 0/3983 dead transitions. [2022-12-13 02:47:36,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-13 02:47:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2022-12-13 02:47:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 2016 transitions. [2022-12-13 02:47:36,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2022-12-13 02:47:36,942 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 350 predicate places. [2022-12-13 02:47:36,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:37,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:38,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:47:38,088 INFO L89 Accepts]: Start accepts. Operand has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:38,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:47:38,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:47:38,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:39,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:39,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 4898 [2022-12-13 02:47:39,537 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:47:39,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1450 [2022-12-13 02:47:39,538 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 3983 transitions, 84055 flow [2022-12-13 02:47:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 14.464646464646465) internal successors, (1432), 99 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:47:39,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:47:39,540 INFO L214 CegarLoopForPetriNet]: trace histogram [96, 96, 96, 96, 96, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:47:39,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 02:47:39,741 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-13 02:47:39,741 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-13 02:47:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:47:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -870034880, now seen corresponding path program 1 times [2022-12-13 02:47:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:47:39,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254338574] [2022-12-13 02:47:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:47:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:47:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:47:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30840 backedges. 0 proven. 30840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:47:49,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:47:49,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254338574] [2022-12-13 02:47:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254338574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:47:49,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729460182] [2022-12-13 02:47:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:47:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:47:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:47:49,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:47:49,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 02:47:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:47:50,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 4615 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 02:47:50,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:47:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30840 backedges. 0 proven. 30840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:47:50,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:48:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30840 backedges. 0 proven. 30840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:48:00,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729460182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:48:00,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:48:00,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2022-12-13 02:48:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000184110] [2022-12-13 02:48:00,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:48:00,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 197 states [2022-12-13 02:48:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:48:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2022-12-13 02:48:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2022-12-13 02:48:00,046 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2022-12-13 02:48:00,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 3983 transitions, 84055 flow. Second operand has 197 states, 197 states have (on average 14.48730964467005) internal successors, (2854), 197 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:48:00,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:48:00,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2022-12-13 02:48:00,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:49:11,899 INFO L130 PetriNetUnfolder]: 15536/36128 cut-off events. [2022-12-13 02:49:11,899 INFO L131 PetriNetUnfolder]: For 392224/392224 co-relation queries the response was YES. [2022-12-13 02:49:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358745 conditions, 36128 events. 15536/36128 cut-off events. For 392224/392224 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 155020 event pairs, 12 based on Foata normal form. 0/31351 useless extension candidates. Maximal degree in co-relation 357740. Up to 28141 conditions per place. [2022-12-13 02:49:12,107 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 7019 selfloop transitions, 393 changer transitions 0/7707 dead transitions. [2022-12-13 02:49:12,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-12-13 02:49:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2022-12-13 02:49:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 4025 transitions. [2022-12-13 02:49:12,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4667207792207792 [2022-12-13 02:49:12,117 INFO L295 CegarLoopForPetriNet]: 81 programPoint places, 545 predicate places. [2022-12-13 02:49:12,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:12,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:15,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:49:15,416 INFO L89 Accepts]: Start accepts. Operand has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:18,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:49:18,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:49:18,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:21,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:21,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 9210 [2022-12-13 02:49:21,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:49:21,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5763 [2022-12-13 02:49:21,179 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 7707 transitions, 182571 flow [2022-12-13 02:49:21,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 197 states, 197 states have (on average 14.48730964467005) internal successors, (2854), 197 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:49:21,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:49:21,181 INFO L214 CegarLoopForPetriNet]: trace histogram [194, 194, 194, 194, 193, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:49:21,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 02:49:21,388 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-13 02:49:21,389 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-13 02:49:21,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:49:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1016801732, now seen corresponding path program 1 times [2022-12-13 02:49:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:49:21,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9666842] [2022-12-13 02:49:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:49:21,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:49:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:50:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 126294 backedges. 0 proven. 126294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:50:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:50:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9666842] [2022-12-13 02:50:00,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9666842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:50:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762207695] [2022-12-13 02:50:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:50:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:50:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:50:00,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:50:00,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 02:50:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:50:02,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 9073 conjuncts, 196 conjunts are in the unsatisfiable core [2022-12-13 02:50:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:50:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 126294 backedges. 0 proven. 126294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:50:03,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:50:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 126294 backedges. 0 proven. 126294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:50:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762207695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:50:38,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:50:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 197, 197] total 393 [2022-12-13 02:50:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940380729] [2022-12-13 02:50:38,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:50:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 393 states [2022-12-13 02:50:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:50:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 393 interpolants. [2022-12-13 02:50:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77028, Invalid=77028, Unknown=0, NotChecked=0, Total=154056 [2022-12-13 02:50:38,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2022-12-13 02:50:38,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 7707 transitions, 182571 flow. Second operand has 393 states, 393 states have (on average 14.493638676844784) internal successors, (5696), 393 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:50:38,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:50:38,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2022-12-13 02:50:38,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 02:59:00,650 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:59:00,687 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:59:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 383 states. [2022-12-13 02:59:00,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 02:59:00,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 02:59:00,975 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-13 02:59:00,975 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (393states, 9/44 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 747275 conditions, 69903 events (30005/69902 cut-off events. For 925110/925110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 300888 event pairs, 12 based on Foata normal form. 0/60793 useless extension candidates. Maximal degree in co-relation 747232. Up to 54326 conditions per place.). [2022-12-13 02:59:00,977 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 02:59:00,977 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 02:59:00,977 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 02:59:00,977 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 02:59:00,978 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:59:00,981 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:59:00,982 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:59:00,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:59:00 BasicIcfg [2022-12-13 02:59:00,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:59:00,984 INFO L158 Benchmark]: Toolchain (without parser) took 750649.38ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 151.1MB in the beginning and 33.3MB in the end (delta: 117.7MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-13 02:59:00,984 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:59:00,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.34ms. Allocated memory is still 176.2MB. Free memory was 151.1MB in the beginning and 120.9MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 02:59:00,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.03ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 118.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:59:00,985 INFO L158 Benchmark]: Boogie Preprocessor took 56.84ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:59:00,985 INFO L158 Benchmark]: RCFGBuilder took 583.07ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 95.3MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 02:59:00,985 INFO L158 Benchmark]: TraceAbstraction took 749281.86ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 94.2MB in the beginning and 33.3MB in the end (delta: 60.9MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-13 02:59:00,986 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 176.2MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 651.34ms. Allocated memory is still 176.2MB. Free memory was 151.1MB in the beginning and 120.9MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.03ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 118.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.84ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 583.07ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 95.3MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 749281.86ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 94.2MB in the beginning and 33.3MB in the end (delta: 60.9MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 198 PlacesBefore, 81 PlacesAfterwards, 204 TransitionsBefore, 82 TransitionsAfterwards, 9810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 97 ConcurrentYvCompositions, 6 ChoiceCompositions, 167 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 9459, independent unconditional: 0, dependent: 248, dependent conditional: 248, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9707, independent: 9459, independent conditional: 0, independent unconditional: 9459, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7053, independent: 6946, independent conditional: 0, independent unconditional: 6946, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7053, independent: 6926, independent conditional: 0, independent unconditional: 6926, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 127, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9707, independent: 2513, independent conditional: 0, independent unconditional: 2513, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 7053, unknown conditional: 0, unknown unconditional: 7053] , Statistics on independence cache: Total cache size (in pairs): 14193, Positive cache size: 14086, Positive conditional cache size: 0, Positive unconditional cache size: 14086, Negative cache size: 107, Negative conditional cache size: 0, Negative unconditional cache size: 107, 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, 81 PlacesBefore, 81 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 27, independent conditional: 8, independent unconditional: 19, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 44, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 64, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 366 TransitionsBefore, 366 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 70, independent conditional: 70, 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: 96, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 122, dependent conditional: 0, dependent unconditional: 122, 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: 192, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 192, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 139 PlacesBefore, 139 PlacesAfterwards, 726 TransitionsBefore, 726 TransitionsAfterwards, 2944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 290, dependent conditional: 0, dependent unconditional: 290, 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: 294, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 292, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 335 PlacesBefore, 334 PlacesAfterwards, 2150 TransitionsBefore, 2149 TransitionsAfterwards, 2782 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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, 431 PlacesBefore, 431 PlacesAfterwards, 3983 TransitionsBefore, 3983 TransitionsAfterwards, 4898 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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, 626 PlacesBefore, 626 PlacesAfterwards, 7707 TransitionsBefore, 7707 TransitionsAfterwards, 9210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (393states, 9/44 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 747275 conditions, 69903 events (30005/69902 cut-off events. For 925110/925110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 300888 event pairs, 12 based on Foata normal form. 0/60793 useless extension candidates. Maximal degree in co-relation 747232. Up to 54326 conditions per place.). - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (393states, 9/44 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 747275 conditions, 69903 events (30005/69902 cut-off events. For 925110/925110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 300888 event pairs, 12 based on Foata normal form. 0/60793 useless extension candidates. Maximal degree in co-relation 747232. Up to 54326 conditions per place.). - 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 enhancing Floyd-Hoare automaton (393states, 9/44 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 747275 conditions, 69903 events (30005/69902 cut-off events. For 925110/925110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 300888 event pairs, 12 based on Foata normal form. 0/60793 useless extension candidates. Maximal degree in co-relation 747232. Up to 54326 conditions per place.). - 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 enhancing Floyd-Hoare automaton (393states, 9/44 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 747275 conditions, 69903 events (30005/69902 cut-off events. For 925110/925110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 300888 event pairs, 12 based on Foata normal form. 0/60793 useless extension candidates. Maximal degree in co-relation 747232. Up to 54326 conditions per place.). - 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: 749.1s, OverallIterations: 12, TraceHistogramMax: 194, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 608.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32544 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32544 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 189 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11018 IncrementalHoareTripleChecker+Invalid, 12377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1170 mSolverCounterUnsat, 1 mSDtfsCounter, 11018 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7384 GetRequests, 6311 SyntacticMatches, 47 SemanticMatches, 1026 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31399 ImplicationChecksByTransitivity, 71.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182571occurred in iteration=11, InterpolantAutomatonStates: 594, 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: 1.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 109.2s InterpolantComputationTime, 6595 NumberOfCodeBlocks, 6294 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9824 ConstructedInterpolants, 3 QuantifiedInterpolants, 31571 SizeOfPredicates, 14 NumberOfNonLiveVariables, 19102 ConjunctsInSsa, 433 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 14134/521299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2022-12-13 02:59:01,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 !ENTRY org.eclipse.osgi 4 0 2022-12-13 02:59:01.288 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be2ba391/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be2ba391/.metadata/.log.