/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_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:46:36,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:46:36,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:46:36,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:46:36,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:46:36,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:46:36,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:46:36,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:46:36,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:46:36,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:46:36,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:46:36,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:46:36,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:46:36,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:46:36,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:46:36,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:46:36,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:46:36,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:46:36,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:46:36,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:46:36,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:46:36,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:46:36,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:46:36,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:46:36,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:46:36,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:46:36,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:46:36,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:46:36,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:46:36,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:46:36,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:46:36,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:46:36,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:46:36,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:46:36,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:46:36,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:46:36,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:46:36,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:46:36,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:46:36,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:46:36,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:46:36,228 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-06 00:46:36,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:46:36,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:46:36,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:46:36,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:46:36,248 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:46:36,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:46:36,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:46:36,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:46:36,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:46:36,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:46:36,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:46:36,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:46:36,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:46:36,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:46:36,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:46:36,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:46:36,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:46:36,252 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-06 00:46:36,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:46:36,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:46:36,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:46:36,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:46:36,567 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:46:36,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2022-12-06 00:46:37,579 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:46:37,801 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:46:37,801 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-12-06 00:46:37,814 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e55c383/03c5ccb7997942bd95f657a50f96207b/FLAG34bae4c23 [2022-12-06 00:46:37,826 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e55c383/03c5ccb7997942bd95f657a50f96207b [2022-12-06 00:46:37,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:46:37,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:46:37,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:46:37,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:46:37,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:46:37,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:46:37" (1/1) ... [2022-12-06 00:46:37,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a6cf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:37, skipping insertion in model container [2022-12-06 00:46:37,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:46:37" (1/1) ... [2022-12-06 00:46:37,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:46:37,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:46:38,272 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_longer.i[43296,43309] [2022-12-06 00:46:38,279 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_longer.i[43503,43516] [2022-12-06 00:46:38,282 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_longer.i[43783,43796] [2022-12-06 00:46:38,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:46:38,295 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:46:38,330 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_longer.i[43296,43309] [2022-12-06 00:46:38,335 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_longer.i[43503,43516] [2022-12-06 00:46:38,340 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_longer.i[43783,43796] [2022-12-06 00:46:38,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:46:38,405 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:46:38,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38 WrapperNode [2022-12-06 00:46:38,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:46:38,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:46:38,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:46:38,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:46:38,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,468 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-06 00:46:38,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:46:38,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:46:38,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:46:38,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:46:38,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,498 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:46:38,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:46:38,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:46:38,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:46:38,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (1/1) ... [2022-12-06 00:46:38,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:46:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:46:38,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:46:38,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:46:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 00:46:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 00:46:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 00:46:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 00:46:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:46:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:46:38,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:46:38,588 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:46:38,703 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:46:38,704 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:46:39,009 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:46:39,018 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:46:39,019 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 00:46:39,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:46:39 BoogieIcfgContainer [2022-12-06 00:46:39,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:46:39,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:46:39,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:46:39,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:46:39,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:46:37" (1/3) ... [2022-12-06 00:46:39,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d3cbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:46:39, skipping insertion in model container [2022-12-06 00:46:39,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:46:38" (2/3) ... [2022-12-06 00:46:39,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d3cbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:46:39, skipping insertion in model container [2022-12-06 00:46:39,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:46:39" (3/3) ... [2022-12-06 00:46:39,027 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-06 00:46:39,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:46:39,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 00:46:39,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:46:39,146 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:46:39,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 00:46:39,258 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-06 00:46:39,258 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:46:39,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-06 00:46:39,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-06 00:46:39,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-06 00:46:39,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:39,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 00:46:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 245 transitions, 499 flow [2022-12-06 00:46:39,331 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-12-06 00:46:39,332 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:46:39,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 15/245 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-06 00:46:39,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-06 00:46:39,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-06 00:46:46,876 INFO L203 LiptonReduction]: Total number of compositions: 192 [2022-12-06 00:46:46,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:46:46,891 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;@232e0403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:46:46,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 00:46:46,892 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-06 00:46:46,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:46:46,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:46,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 00:46:46,893 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 4 more)] === [2022-12-06 00:46:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1001, now seen corresponding path program 1 times [2022-12-06 00:46:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:46,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838132972] [2022-12-06 00:46:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838132972] [2022-12-06 00:46:46,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838132972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:46,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:46,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 00:46:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902720075] [2022-12-06 00:46:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:46,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:46:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:46:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:46:46,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 72 [2022-12-06 00:46:46,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:46,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:46,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 72 [2022-12-06 00:46:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:47,202 INFO L130 PetriNetUnfolder]: 1465/2555 cut-off events. [2022-12-06 00:46:47,203 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 00:46:47,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4904 conditions, 2555 events. 1465/2555 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12526 event pairs, 1167 based on Foata normal form. 28/2017 useless extension candidates. Maximal degree in co-relation 4773. Up to 2271 conditions per place. [2022-12-06 00:46:47,234 INFO L137 encePairwiseOnDemand]: 66/72 looper letters, 54 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2022-12-06 00:46:47,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 249 flow [2022-12-06 00:46:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:46:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:46:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-12-06 00:46:47,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 00:46:47,245 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2022-12-06 00:46:47,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:47,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 66 transitions, 249 flow [2022-12-06 00:46:47,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 66 transitions, 249 flow [2022-12-06 00:46:47,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 00:46:47,417 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:46:47,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:46:47,418 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 243 flow [2022-12-06 00:46:47,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:47,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:47,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:46:47,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1671037947, now seen corresponding path program 1 times [2022-12-06 00:46:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:47,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272548528] [2022-12-06 00:46:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272548528] [2022-12-06 00:46:47,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272548528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:47,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:47,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:46:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866702625] [2022-12-06 00:46:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:47,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:46:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:47,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:46:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:46:47,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 61 [2022-12-06 00:46:47,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:47,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:47,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 61 [2022-12-06 00:46:47,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:47,866 INFO L130 PetriNetUnfolder]: 1268/2127 cut-off events. [2022-12-06 00:46:47,867 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 00:46:47,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 2127 events. 1268/2127 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8556 event pairs, 655 based on Foata normal form. 62/1681 useless extension candidates. Maximal degree in co-relation 6035. Up to 2030 conditions per place. [2022-12-06 00:46:47,875 INFO L137 encePairwiseOnDemand]: 57/61 looper letters, 69 selfloop transitions, 3 changer transitions 10/87 dead transitions. [2022-12-06 00:46:47,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 517 flow [2022-12-06 00:46:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:46:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:46:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-12-06 00:46:47,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5355191256830601 [2022-12-06 00:46:47,887 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2022-12-06 00:46:47,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:47,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 87 transitions, 517 flow [2022-12-06 00:46:47,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 87 transitions, 517 flow [2022-12-06 00:46:47,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 00:46:47,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:46:47,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 00:46:47,949 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 87 transitions, 517 flow [2022-12-06 00:46:47,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:47,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:47,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:47,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:46:47,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash -510252668, now seen corresponding path program 1 times [2022-12-06 00:46:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:47,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426449011] [2022-12-06 00:46:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426449011] [2022-12-06 00:46:48,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426449011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:48,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:48,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:46:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110504295] [2022-12-06 00:46:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:46:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:46:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:46:48,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 62 [2022-12-06 00:46:48,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 87 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:48,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:48,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 62 [2022-12-06 00:46:48,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:49,571 INFO L130 PetriNetUnfolder]: 1272/2142 cut-off events. [2022-12-06 00:46:49,571 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 00:46:49,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8388 conditions, 2142 events. 1272/2142 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8795 event pairs, 610 based on Foata normal form. 12/1642 useless extension candidates. Maximal degree in co-relation 8048. Up to 2045 conditions per place. [2022-12-06 00:46:49,581 INFO L137 encePairwiseOnDemand]: 54/62 looper letters, 74 selfloop transitions, 9 changer transitions 21/109 dead transitions. [2022-12-06 00:46:49,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 860 flow [2022-12-06 00:46:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:46:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:46:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 00:46:49,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2439516129032258 [2022-12-06 00:46:49,586 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 2 predicate places. [2022-12-06 00:46:49,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:49,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 109 transitions, 860 flow [2022-12-06 00:46:49,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 109 transitions, 860 flow [2022-12-06 00:46:49,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 00:46:49,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L1010-1-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_43| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_79|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_43|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_63|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_111|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_69|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_71|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 00:46:50,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] $Ultimate##0-->L1010-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_208| |v_~#m~0.base_102|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_33| |v_~#queue~0.base_81|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_33| |v_~#queue~0.offset_76|) (= (store |v_#pthreadsMutex_208| |v_~#m~0.base_102| (store .cse0 |v_~#m~0.offset_102| 1)) |v_#pthreadsMutex_207|) (= |v_t1Thread1of1ForFork0_#t~nondet50#1_32| |v_t1Thread1of1ForFork0_~value~0#1_75|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_32| 2147483647) (= |v_t1Thread1of1ForFork0_~arg#1.base_23| |v_t1Thread1of1ForFork0_#in~arg#1.base_23|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_32| 2147483648)) (= (select .cse0 |v_~#m~0.offset_102|) 0) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_23| |v_t1Thread1of1ForFork0_~arg#1.offset_23|) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_35| |v_t1Thread1of1ForFork0_~value~0#1_75|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_208|, ~#m~0.base=|v_~#m~0.base_102|, ~#queue~0.base=|v_~#queue~0.base_81|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_32|, ~#m~0.offset=|v_~#m~0.offset_102|, ~#queue~0.offset=|v_~#queue~0.offset_76|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_23|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_207|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_73|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_23|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_75|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_23|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_33|, ~#m~0.base=|v_~#m~0.base_102|, ~#queue~0.base=|v_~#queue~0.base_81|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_35|, ~#m~0.offset=|v_~#m~0.offset_102|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_27|, ~#queue~0.offset=|v_~#queue~0.offset_76|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_23|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_33|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~q#1.base] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 00:46:50,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [986] $Ultimate##0-->L1063-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_324| |v_~#m~0.base_158|))) (and (= |v_ULTIMATE.start_main_#t~pre64#1_55| |v_#pthreadsForks_80|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_53| |v_~#queue~0.base_119|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_44| 2147483648)) (= |v_t1Thread1of1ForFork0_#t~nondet50#1_44| |v_t1Thread1of1ForFork0_~value~0#1_99|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_53| |v_~#queue~0.offset_114|) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_55| |v_t1Thread1of1ForFork0_~value~0#1_99|) (= (store |v_#memory_int_941| |v_ULTIMATE.start_main_~#id2~0#1.base_59| (store (select |v_#memory_int_941| |v_ULTIMATE.start_main_~#id2~0#1.base_59|) |v_ULTIMATE.start_main_~#id2~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre64#1_55|)) |v_#memory_int_940|) (= (store |v_#pthreadsMutex_324| |v_~#m~0.base_158| (store .cse0 |v_~#m~0.offset_158| 1)) |v_#pthreadsMutex_323|) (= |v_t1Thread1of1ForFork0_~arg#1.base_33| |v_t1Thread1of1ForFork0_#in~arg#1.base_33|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_33| |v_t1Thread1of1ForFork0_~arg#1.offset_33|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_44| 2147483647) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1)) (= (select .cse0 |v_~#m~0.offset_158|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_324|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_59|, ~#m~0.base=|v_~#m~0.base_158|, ~#queue~0.base=|v_~#queue~0.base_119|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_44|, #pthreadsForks=|v_#pthreadsForks_80|, ~#m~0.offset=|v_~#m~0.offset_158|, #memory_int=|v_#memory_int_941|, ~#queue~0.offset=|v_~#queue~0.offset_114|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_59|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_57|, #pthreadsMutex=|v_#pthreadsMutex_323|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_59|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_113|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_33|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_99|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_55|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_33|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_53|, ~#m~0.base=|v_~#m~0.base_158|, ~#queue~0.base=|v_~#queue~0.base_119|, #pthreadsForks=|v_#pthreadsForks_79|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_55|, ~#m~0.offset=|v_~#m~0.offset_158|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_37|, #memory_int=|v_#memory_int_940|, ~#queue~0.offset=|v_~#queue~0.offset_114|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_33|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_53|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_31|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_59|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_~value~0#1, ULTIMATE.start_main_#t~pre64#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_#t~nondet50#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, #memory_int, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, ULTIMATE.start_main_#t~nondet63#1] and [928] L1010-1-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_43| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|) (= (select (select |v_#memory_int_592| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_205|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_75|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_79|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_29|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_205|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_31|, #memory_int=|v_#memory_int_592|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_43|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_63|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_111|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_29|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_69|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_71|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 00:46:50,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [988] $Ultimate##0-->L1063-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_332| |v_~#m~0.base_162|))) (and (= |v_#pthreadsMutex_331| (store |v_#pthreadsMutex_332| |v_~#m~0.base_162| (store .cse0 |v_~#m~0.offset_162| 1))) (= |v_t1Thread1of1ForFork0_~value~0#1_103| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_59|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_57| |v_~#queue~0.base_123|) (= |v_#pthreadsForks_83| (+ |v_#pthreadsForks_84| 1)) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| (select (select |v_#memory_int_949| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_299|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_299| 1604))) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_37| |v_t1Thread1of1ForFork0_~arg#1.offset_37|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_57| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_299|) (= |v_t1Thread1of1ForFork0_~value~0#1_103| |v_t1Thread1of1ForFork0_#t~nondet50#1_52|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_52| 2147483648)) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_52| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_299| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_57|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_57| |v_~#queue~0.offset_118|) (= (select .cse0 |v_~#m~0.offset_162|) 0) (= |v_ULTIMATE.start_main_#t~pre64#1_57| |v_#pthreadsForks_84|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_75| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_59|) (= |v_#memory_int_948| (store |v_#memory_int_949| |v_ULTIMATE.start_main_~#id2~0#1.base_61| (store (select |v_#memory_int_949| |v_ULTIMATE.start_main_~#id2~0#1.base_61|) |v_ULTIMATE.start_main_~#id2~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre64#1_57|))) (= |v_t1Thread1of1ForFork0_~arg#1.base_37| |v_t1Thread1of1ForFork0_#in~arg#1.base_37|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_332|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_61|, ~#m~0.base=|v_~#m~0.base_162|, ~#queue~0.base=|v_~#queue~0.base_123|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_52|, #pthreadsForks=|v_#pthreadsForks_84|, ~#m~0.offset=|v_~#m~0.offset_162|, #memory_int=|v_#memory_int_949|, ~#queue~0.offset=|v_~#queue~0.offset_118|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_37|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_61|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_37|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_117|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_37|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_299|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_103|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_57|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_57|, ~#queue~0.base=|v_~#queue~0.base_123|, #pthreadsForks=|v_#pthreadsForks_83|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_299|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_59|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_121|, ~#queue~0.offset=|v_~#queue~0.offset_118|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_37|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_179|, ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_59|, #pthreadsMutex=|v_#pthreadsMutex_331|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_61|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_111|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_125|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_37|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|, ~#m~0.base=|v_~#m~0.base_162|, ~#m~0.offset=|v_~#m~0.offset_162|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_41|, #memory_int=|v_#memory_int_948|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_75|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_57|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_33|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_103|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_37|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_61|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_103|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, ULTIMATE.start_main_#t~pre64#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, #pthreadsForks, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, t1Thread1of1ForFork0_enqueue_#t~mem39#1, ULTIMATE.start_main_#t~pre62#1, #pthreadsMutex, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_#t~nondet49#1, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, ULTIMATE.start_main_#t~nondet63#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [801] L980-1-->L981: Formula: (= (store |v_#memory_int_173| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_77| (store (select |v_#memory_int_173| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)) |v_#memory_int_172|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|, #memory_int=|v_#memory_int_173|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_21|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_77|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_77|, #memory_int=|v_#memory_int_172|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_21|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_enqueue_#t~mem36#1] [2022-12-06 00:46:50,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [985] L981-4-->L982-4: Formula: (let ((.cse0 (select |v_#memory_int_937| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_295|)) (.cse1 (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_295| 1604))) (and (= 400 (select .cse0 .cse1)) (= (store |v_#memory_int_937| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_295| (store .cse0 .cse1 1)) |v_#memory_int_936|))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_295|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_295|, #memory_int=|v_#memory_int_937|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_295|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_295|, #memory_int=|v_#memory_int_936|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_173|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_99|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 00:46:50,615 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:46:50,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1030 [2022-12-06 00:46:50,616 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 848 flow [2022-12-06 00:46:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:50,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:50,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:46:50,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1499047469, now seen corresponding path program 1 times [2022-12-06 00:46:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077685448] [2022-12-06 00:46:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077685448] [2022-12-06 00:46:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077685448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:51,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:51,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:46:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954746870] [2022-12-06 00:46:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:51,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:46:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:46:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:46:51,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 67 [2022-12-06 00:46:51,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 848 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:51,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:51,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 67 [2022-12-06 00:46:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:51,550 INFO L130 PetriNetUnfolder]: 1255/2108 cut-off events. [2022-12-06 00:46:51,551 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 00:46:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 2108 events. 1255/2108 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8722 event pairs, 270 based on Foata normal form. 11/1611 useless extension candidates. Maximal degree in co-relation 9856. Up to 2014 conditions per place. [2022-12-06 00:46:51,562 INFO L137 encePairwiseOnDemand]: 57/67 looper letters, 98 selfloop transitions, 9 changer transitions 20/132 dead transitions. [2022-12-06 00:46:51,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 1314 flow [2022-12-06 00:46:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:46:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:46:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-06 00:46:51,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2814498933901919 [2022-12-06 00:46:51,565 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2022-12-06 00:46:51,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:51,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 132 transitions, 1314 flow [2022-12-06 00:46:51,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 132 transitions, 1314 flow [2022-12-06 00:46:51,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 00:46:51,838 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:46:51,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 273 [2022-12-06 00:46:51,839 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 134 transitions, 1352 flow [2022-12-06 00:46:51,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:51,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:51,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:46:51,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1956717746, now seen corresponding path program 1 times [2022-12-06 00:46:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:51,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358415129] [2022-12-06 00:46:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:52,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:52,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358415129] [2022-12-06 00:46:52,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358415129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:52,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:52,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:46:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072778513] [2022-12-06 00:46:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:52,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:46:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:46:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:46:52,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2022-12-06 00:46:52,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 134 transitions, 1352 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:52,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:52,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2022-12-06 00:46:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:52,743 INFO L130 PetriNetUnfolder]: 1258/2199 cut-off events. [2022-12-06 00:46:52,743 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 00:46:52,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12792 conditions, 2199 events. 1258/2199 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9866 event pairs, 270 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 12280. Up to 2096 conditions per place. [2022-12-06 00:46:52,753 INFO L137 encePairwiseOnDemand]: 56/69 looper letters, 102 selfloop transitions, 16 changer transitions 22/145 dead transitions. [2022-12-06 00:46:52,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 145 transitions, 1724 flow [2022-12-06 00:46:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:46:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:46:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2022-12-06 00:46:52,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2246376811594203 [2022-12-06 00:46:52,756 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2022-12-06 00:46:52,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:52,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 145 transitions, 1724 flow [2022-12-06 00:46:52,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 145 transitions, 1724 flow [2022-12-06 00:46:52,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 00:46:52,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L988-->L988-2: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33| (select (select |v_#memory_int_136| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|) (+ 1604 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|))) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_29| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33|)) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|, #memory_int=|v_#memory_int_136|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_69|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_69|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_29|, #memory_int=|v_#memory_int_136|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_33|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 00:46:52,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] L958-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.base_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|) (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_11| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_15| (select (select |v_#memory_int_138| |v_t1Thread1of1ForFork0_empty_~q#1.base_11|) (+ 1600 |v_t1Thread1of1ForFork0_empty_~q#1.offset_11|)))) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, #memory_int=|v_#memory_int_138|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_11|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_7|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_15|, #memory_int=|v_#memory_int_138|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_11|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_7|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base] and [911] L1062-4-->L1063-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_58|) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|) (= (store |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35| (store (select |v_#memory_int_487| |v_ULTIMATE.start_main_~#id2~0#1.base_35|) |v_ULTIMATE.start_main_~#id2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre64#1_33|)) |v_#memory_int_486|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_58|, #memory_int=|v_#memory_int_487|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_27|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_35|, #pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_486|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_9|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 00:46:52,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1001] L988-->L1063-3: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_137| (select (select |v_#memory_int_995| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_311|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_311| 1604))) (= |v_#pthreadsForks_99| (+ |v_#pthreadsForks_100| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_65| |v_#pthreadsForks_100|) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_137|) (= (store |v_#memory_int_995| |v_ULTIMATE.start_main_~#id2~0#1.base_69| (store (select |v_#memory_int_995| |v_ULTIMATE.start_main_~#id2~0#1.base_69|) |v_ULTIMATE.start_main_~#id2~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre64#1_65|)) |v_#memory_int_994|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_69|, #pthreadsForks=|v_#pthreadsForks_100|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_311|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_311|, #memory_int=|v_#memory_int_995|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_69|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_67|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_69|, #pthreadsForks=|v_#pthreadsForks_99|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_311|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_311|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_123|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_65|, #memory_int=|v_#memory_int_994|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_137|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_41|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_69|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, t1Thread1of1ForFork0_enqueue_#t~post41#1, ULTIMATE.start_main_#t~pre64#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem40#1, ULTIMATE.start_main_#t~nondet63#1] and [927] L988-2-->L982-4: Formula: (= (store |v_#memory_int_589| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_203| (store (select |v_#memory_int_589| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203| 1604) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_72| 1))) |v_#memory_int_588|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_72|, #memory_int=|v_#memory_int_589|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_203|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_203|, #memory_int=|v_#memory_int_588|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_77|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem40#1] [2022-12-06 00:46:52,995 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:46:52,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:46:52,996 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 143 transitions, 1704 flow [2022-12-06 00:46:52,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:52,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:52,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:52,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:46:52,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1210853457, now seen corresponding path program 1 times [2022-12-06 00:46:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:52,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006131852] [2022-12-06 00:46:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006131852] [2022-12-06 00:46:53,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006131852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:53,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:53,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:46:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801482806] [2022-12-06 00:46:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:53,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:46:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:46:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:46:53,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2022-12-06 00:46:53,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 143 transitions, 1704 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:53,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:53,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2022-12-06 00:46:53,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:46:53,947 INFO L130 PetriNetUnfolder]: 1509/2644 cut-off events. [2022-12-06 00:46:53,947 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 00:46:53,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17982 conditions, 2644 events. 1509/2644 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12722 event pairs, 414 based on Foata normal form. 0/2058 useless extension candidates. Maximal degree in co-relation 17258. Up to 2531 conditions per place. [2022-12-06 00:46:53,966 INFO L137 encePairwiseOnDemand]: 51/69 looper letters, 137 selfloop transitions, 19 changer transitions 39/200 dead transitions. [2022-12-06 00:46:53,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 200 transitions, 2799 flow [2022-12-06 00:46:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:46:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:46:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2022-12-06 00:46:53,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.302536231884058 [2022-12-06 00:46:53,971 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2022-12-06 00:46:53,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:46:53,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 200 transitions, 2799 flow [2022-12-06 00:46:53,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 200 transitions, 2799 flow [2022-12-06 00:46:53,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 00:46:54,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:46:54,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 00:46:54,084 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 201 transitions, 2823 flow [2022-12-06 00:46:54,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:54,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:46:54,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:46:54,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:46:54,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:46:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:46:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 269414090, now seen corresponding path program 1 times [2022-12-06 00:46:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:46:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809994318] [2022-12-06 00:46:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:46:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:46:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:46:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:46:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:46:59,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809994318] [2022-12-06 00:46:59,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809994318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:46:59,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:46:59,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:46:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544323377] [2022-12-06 00:46:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:46:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:46:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:46:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:46:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:46:59,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 71 [2022-12-06 00:46:59,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 201 transitions, 2823 flow. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:46:59,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:46:59,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 71 [2022-12-06 00:46:59,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:15,692 INFO L130 PetriNetUnfolder]: 1858/3310 cut-off events. [2022-12-06 00:47:15,693 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 00:47:15,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25481 conditions, 3310 events. 1858/3310 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17345 event pairs, 324 based on Foata normal form. 0/2590 useless extension candidates. Maximal degree in co-relation 24377. Up to 3138 conditions per place. [2022-12-06 00:47:15,708 INFO L137 encePairwiseOnDemand]: 54/71 looper letters, 188 selfloop transitions, 22 changer transitions 56/271 dead transitions. [2022-12-06 00:47:15,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 271 transitions, 4352 flow [2022-12-06 00:47:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:47:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:47:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2022-12-06 00:47:15,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28169014084507044 [2022-12-06 00:47:15,722 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2022-12-06 00:47:15,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:15,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 271 transitions, 4352 flow [2022-12-06 00:47:15,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 271 transitions, 4352 flow [2022-12-06 00:47:15,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:47:15,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:47:15,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 00:47:15,815 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 271 transitions, 4360 flow [2022-12-06 00:47:15,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:15,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:15,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:15,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:47:15,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:15,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1493404099, now seen corresponding path program 1 times [2022-12-06 00:47:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:15,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129175792] [2022-12-06 00:47:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:16,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129175792] [2022-12-06 00:47:16,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129175792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:16,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:16,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:47:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352188] [2022-12-06 00:47:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:16,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:47:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:16,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:47:16,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:47:16,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 70 [2022-12-06 00:47:16,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 271 transitions, 4360 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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-06 00:47:16,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:16,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 70 [2022-12-06 00:47:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:17,120 INFO L130 PetriNetUnfolder]: 2123/3814 cut-off events. [2022-12-06 00:47:17,120 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-06 00:47:17,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33041 conditions, 3814 events. 2123/3814 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 21129 event pairs, 328 based on Foata normal form. 0/2991 useless extension candidates. Maximal degree in co-relation 31618. Up to 3623 conditions per place. [2022-12-06 00:47:17,137 INFO L137 encePairwiseOnDemand]: 52/70 looper letters, 216 selfloop transitions, 29 changer transitions 77/327 dead transitions. [2022-12-06 00:47:17,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 327 transitions, 5913 flow [2022-12-06 00:47:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:47:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:47:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2022-12-06 00:47:17,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2841269841269841 [2022-12-06 00:47:17,141 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2022-12-06 00:47:17,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:17,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 327 transitions, 5913 flow [2022-12-06 00:47:17,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 327 transitions, 5913 flow [2022-12-06 00:47:17,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 00:47:17,164 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:17,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 00:47:17,166 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 327 transitions, 5913 flow [2022-12-06 00:47:17,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 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-06 00:47:17,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:17,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:17,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:47:17,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -389282512, now seen corresponding path program 1 times [2022-12-06 00:47:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:17,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527705627] [2022-12-06 00:47:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:17,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527705627] [2022-12-06 00:47:17,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527705627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:17,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:17,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:47:17,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835929166] [2022-12-06 00:47:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:17,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:47:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:47:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:47:17,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2022-12-06 00:47:17,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 327 transitions, 5913 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:17,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:17,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2022-12-06 00:47:17,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:18,417 INFO L130 PetriNetUnfolder]: 2165/3881 cut-off events. [2022-12-06 00:47:18,418 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-06 00:47:18,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37317 conditions, 3881 events. 2165/3881 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 21506 event pairs, 326 based on Foata normal form. 0/3049 useless extension candidates. Maximal degree in co-relation 35616. Up to 3688 conditions per place. [2022-12-06 00:47:18,435 INFO L137 encePairwiseOnDemand]: 50/69 looper letters, 233 selfloop transitions, 30 changer transitions 91/358 dead transitions. [2022-12-06 00:47:18,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 358 transitions, 7210 flow [2022-12-06 00:47:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:47:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:47:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2022-12-06 00:47:18,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28502415458937197 [2022-12-06 00:47:18,437 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 40 predicate places. [2022-12-06 00:47:18,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:18,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 358 transitions, 7210 flow [2022-12-06 00:47:18,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 358 transitions, 7210 flow [2022-12-06 00:47:18,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 00:47:18,460 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:18,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:47:18,461 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 358 transitions, 7210 flow [2022-12-06 00:47:18,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:18,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:18,462 INFO L213 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-06 00:47:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:47:18,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1368887645, now seen corresponding path program 1 times [2022-12-06 00:47:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724857863] [2022-12-06 00:47:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:19,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724857863] [2022-12-06 00:47:19,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724857863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:19,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:19,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 00:47:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247510335] [2022-12-06 00:47:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:19,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:47:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:19,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:47:19,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:47:19,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-06 00:47:19,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 358 transitions, 7210 flow. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:19,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:19,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-06 00:47:19,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:22,098 INFO L130 PetriNetUnfolder]: 3720/6507 cut-off events. [2022-12-06 00:47:22,099 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-12-06 00:47:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68640 conditions, 6507 events. 3720/6507 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 37081 event pairs, 427 based on Foata normal form. 0/5156 useless extension candidates. Maximal degree in co-relation 64923. Up to 6179 conditions per place. [2022-12-06 00:47:22,129 INFO L137 encePairwiseOnDemand]: 40/67 looper letters, 436 selfloop transitions, 79 changer transitions 109/628 dead transitions. [2022-12-06 00:47:22,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 628 transitions, 13918 flow [2022-12-06 00:47:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 00:47:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 00:47:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 440 transitions. [2022-12-06 00:47:22,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29850746268656714 [2022-12-06 00:47:22,133 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2022-12-06 00:47:22,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:22,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 628 transitions, 13918 flow [2022-12-06 00:47:22,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 628 transitions, 13918 flow [2022-12-06 00:47:22,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-06 00:47:22,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:22,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 00:47:22,171 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 628 transitions, 13918 flow [2022-12-06 00:47:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:22,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:22,172 INFO L213 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-06 00:47:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:47:22,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1329427049, now seen corresponding path program 1 times [2022-12-06 00:47:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895915704] [2022-12-06 00:47:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895915704] [2022-12-06 00:47:22,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895915704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:22,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:22,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:47:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531665135] [2022-12-06 00:47:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:22,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:47:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:47:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:47:22,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-06 00:47:22,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 628 transitions, 13918 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:22,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:22,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-06 00:47:22,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:23,963 INFO L130 PetriNetUnfolder]: 3759/6561 cut-off events. [2022-12-06 00:47:23,963 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-12-06 00:47:23,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75497 conditions, 6561 events. 3759/6561 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 37209 event pairs, 432 based on Foata normal form. 0/5200 useless extension candidates. Maximal degree in co-relation 71451. Up to 6235 conditions per place. [2022-12-06 00:47:24,001 INFO L137 encePairwiseOnDemand]: 53/67 looper letters, 500 selfloop transitions, 22 changer transitions 111/637 dead transitions. [2022-12-06 00:47:24,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 637 transitions, 15385 flow [2022-12-06 00:47:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:47:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:47:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-06 00:47:24,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27798507462686567 [2022-12-06 00:47:24,003 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 68 predicate places. [2022-12-06 00:47:24,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:24,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 637 transitions, 15385 flow [2022-12-06 00:47:24,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 637 transitions, 15385 flow [2022-12-06 00:47:24,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-06 00:47:24,049 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:24,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 00:47:24,050 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 637 transitions, 15385 flow [2022-12-06 00:47:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:24,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:24,050 INFO L213 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-06 00:47:24,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:47:24,050 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1557342104, now seen corresponding path program 1 times [2022-12-06 00:47:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:24,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398562177] [2022-12-06 00:47:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:24,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398562177] [2022-12-06 00:47:30,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398562177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:30,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:30,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 00:47:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478870763] [2022-12-06 00:47:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:30,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:47:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:47:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:47:30,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-06 00:47:30,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 637 transitions, 15385 flow. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:30,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:30,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-06 00:47:30,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:42,885 INFO L130 PetriNetUnfolder]: 6037/10340 cut-off events. [2022-12-06 00:47:42,886 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-06 00:47:42,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128871 conditions, 10340 events. 6037/10340 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 59828 event pairs, 362 based on Foata normal form. 0/8253 useless extension candidates. Maximal degree in co-relation 121532. Up to 9839 conditions per place. [2022-12-06 00:47:42,964 INFO L137 encePairwiseOnDemand]: 44/67 looper letters, 798 selfloop transitions, 122 changer transitions 125/1049 dead transitions. [2022-12-06 00:47:42,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1049 transitions, 27432 flow [2022-12-06 00:47:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 00:47:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 00:47:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 429 transitions. [2022-12-06 00:47:42,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.291044776119403 [2022-12-06 00:47:42,968 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2022-12-06 00:47:42,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:42,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 1049 transitions, 27432 flow [2022-12-06 00:47:43,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 1049 transitions, 27432 flow [2022-12-06 00:47:43,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 1490 [2022-12-06 00:47:43,087 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:43,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 00:47:43,088 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 1049 transitions, 27432 flow [2022-12-06 00:47:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:43,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:43,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:43,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:47:43,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash 139335862, now seen corresponding path program 1 times [2022-12-06 00:47:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:43,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524475514] [2022-12-06 00:47:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:43,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524475514] [2022-12-06 00:47:43,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524475514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:43,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:43,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:47:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692700857] [2022-12-06 00:47:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:47:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:47:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:47:43,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-06 00:47:43,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 1049 transitions, 27432 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:43,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:43,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-06 00:47:43,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:44,018 INFO L130 PetriNetUnfolder]: 1847/3485 cut-off events. [2022-12-06 00:47:44,018 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 00:47:44,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46845 conditions, 3485 events. 1847/3485 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 20214 event pairs, 76 based on Foata normal form. 0/2968 useless extension candidates. Maximal degree in co-relation 42865. Up to 3305 conditions per place. [2022-12-06 00:47:44,034 INFO L137 encePairwiseOnDemand]: 52/67 looper letters, 365 selfloop transitions, 86 changer transitions 140/595 dead transitions. [2022-12-06 00:47:44,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 595 transitions, 16825 flow [2022-12-06 00:47:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:47:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:47:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-06 00:47:44,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4427860696517413 [2022-12-06 00:47:44,037 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 76 predicate places. [2022-12-06 00:47:44,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:44,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 595 transitions, 16825 flow [2022-12-06 00:47:44,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 595 transitions, 16825 flow [2022-12-06 00:47:44,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-06 00:47:44,066 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:44,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:47:44,066 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 595 transitions, 16825 flow [2022-12-06 00:47:44,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:44,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:44,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:47:44,067 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash 798632316, now seen corresponding path program 1 times [2022-12-06 00:47:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:44,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048734889] [2022-12-06 00:47:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048734889] [2022-12-06 00:47:44,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048734889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:44,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:44,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 00:47:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752884224] [2022-12-06 00:47:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:47:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:47:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:47:44,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 65 [2022-12-06 00:47:44,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 595 transitions, 16825 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:44,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:44,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 65 [2022-12-06 00:47:44,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:45,831 INFO L130 PetriNetUnfolder]: 1886/3549 cut-off events. [2022-12-06 00:47:45,831 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-06 00:47:45,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51160 conditions, 3549 events. 1886/3549 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20812 event pairs, 60 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 46901. Up to 3372 conditions per place. [2022-12-06 00:47:45,852 INFO L137 encePairwiseOnDemand]: 44/65 looper letters, 433 selfloop transitions, 37 changer transitions 146/620 dead transitions. [2022-12-06 00:47:45,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 620 transitions, 18772 flow [2022-12-06 00:47:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:47:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:47:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2022-12-06 00:47:45,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24755244755244754 [2022-12-06 00:47:45,854 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 86 predicate places. [2022-12-06 00:47:45,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:45,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 620 transitions, 18772 flow [2022-12-06 00:47:45,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 620 transitions, 18772 flow [2022-12-06 00:47:45,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 882 [2022-12-06 00:47:45,892 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:45,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 00:47:45,893 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 620 transitions, 18772 flow [2022-12-06 00:47:45,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:45,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:45,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:45,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:47:45,893 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 94502267, now seen corresponding path program 1 times [2022-12-06 00:47:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:45,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83430035] [2022-12-06 00:47:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83430035] [2022-12-06 00:47:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83430035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:46,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:46,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:47:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123246382] [2022-12-06 00:47:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:46,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:47:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:47:46,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:47:46,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 65 [2022-12-06 00:47:46,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 620 transitions, 18772 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:46,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:46,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 65 [2022-12-06 00:47:46,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:48,073 INFO L130 PetriNetUnfolder]: 2135/3998 cut-off events. [2022-12-06 00:47:48,073 INFO L131 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2022-12-06 00:47:48,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61511 conditions, 3998 events. 2135/3998 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 24000 event pairs, 56 based on Foata normal form. 0/3413 useless extension candidates. Maximal degree in co-relation 56421. Up to 3804 conditions per place. [2022-12-06 00:47:48,097 INFO L137 encePairwiseOnDemand]: 43/65 looper letters, 501 selfloop transitions, 35 changer transitions 158/698 dead transitions. [2022-12-06 00:47:48,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 698 transitions, 22536 flow [2022-12-06 00:47:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:47:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:47:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2022-12-06 00:47:48,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:47:48,099 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 96 predicate places. [2022-12-06 00:47:48,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:48,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 698 transitions, 22536 flow [2022-12-06 00:47:48,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 698 transitions, 22536 flow [2022-12-06 00:47:48,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-06 00:47:48,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:48,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 00:47:48,140 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 698 transitions, 22536 flow [2022-12-06 00:47:48,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:48,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:48,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:48,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:47:48,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1594352867, now seen corresponding path program 1 times [2022-12-06 00:47:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:48,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579177404] [2022-12-06 00:47:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579177404] [2022-12-06 00:47:50,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579177404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:50,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:50,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-06 00:47:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263787146] [2022-12-06 00:47:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:47:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:50,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:47:50,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:47:50,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 00:47:50,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 698 transitions, 22536 flow. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:50,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:50,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 00:47:50,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:52,425 INFO L130 PetriNetUnfolder]: 3344/5929 cut-off events. [2022-12-06 00:47:52,426 INFO L131 PetriNetUnfolder]: For 28319/28319 co-relation queries the response was YES. [2022-12-06 00:47:52,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88501 conditions, 5929 events. 3344/5929 cut-off events. For 28319/28319 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 36317 event pairs, 406 based on Foata normal form. 54/5186 useless extension candidates. Maximal degree in co-relation 81577. Up to 5083 conditions per place. [2022-12-06 00:47:52,458 INFO L137 encePairwiseOnDemand]: 39/65 looper letters, 573 selfloop transitions, 42 changer transitions 215/831 dead transitions. [2022-12-06 00:47:52,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 831 transitions, 27852 flow [2022-12-06 00:47:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:47:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:47:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 241 transitions. [2022-12-06 00:47:52,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1951417004048583 [2022-12-06 00:47:52,461 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2022-12-06 00:47:52,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:52,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 831 transitions, 27852 flow [2022-12-06 00:47:52,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 831 transitions, 27852 flow [2022-12-06 00:47:52,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 00:47:52,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:52,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 00:47:52,530 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 831 transitions, 27852 flow [2022-12-06 00:47:52,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:52,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:52,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:47:52,531 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -924743697, now seen corresponding path program 1 times [2022-12-06 00:47:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883500020] [2022-12-06 00:47:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:53,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883500020] [2022-12-06 00:47:53,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883500020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:53,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:53,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 00:47:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633049157] [2022-12-06 00:47:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:53,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:47:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:47:53,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:47:53,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 65 [2022-12-06 00:47:53,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 831 transitions, 27852 flow. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:53,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:53,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 65 [2022-12-06 00:47:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:47:55,462 INFO L130 PetriNetUnfolder]: 3654/6497 cut-off events. [2022-12-06 00:47:55,463 INFO L131 PetriNetUnfolder]: For 34000/34000 co-relation queries the response was YES. [2022-12-06 00:47:55,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102368 conditions, 6497 events. 3654/6497 cut-off events. For 34000/34000 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 40855 event pairs, 444 based on Foata normal form. 0/5632 useless extension candidates. Maximal degree in co-relation 93725. Up to 5559 conditions per place. [2022-12-06 00:47:55,498 INFO L137 encePairwiseOnDemand]: 40/65 looper letters, 621 selfloop transitions, 64 changer transitions 221/909 dead transitions. [2022-12-06 00:47:55,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 909 transitions, 32314 flow [2022-12-06 00:47:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:47:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:47:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 209 transitions. [2022-12-06 00:47:55,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24733727810650888 [2022-12-06 00:47:55,500 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 126 predicate places. [2022-12-06 00:47:55,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:47:55,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 909 transitions, 32314 flow [2022-12-06 00:47:55,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 909 transitions, 32314 flow [2022-12-06 00:47:55,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 00:47:55,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:47:55,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 00:47:55,562 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 909 transitions, 32314 flow [2022-12-06 00:47:55,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:55,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:47:55,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:47:55,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:47:55,563 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:47:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:47:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1853049770, now seen corresponding path program 1 times [2022-12-06 00:47:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:47:55,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547129268] [2022-12-06 00:47:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:47:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:47:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:47:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:47:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:47:58,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547129268] [2022-12-06 00:47:58,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547129268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:47:58,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:47:58,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-06 00:47:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765204388] [2022-12-06 00:47:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:47:58,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:47:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:47:58,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:47:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:47:58,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 00:47:58,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 909 transitions, 32314 flow. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:47:58,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:47:58,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 00:47:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:48:04,032 INFO L130 PetriNetUnfolder]: 4224/7552 cut-off events. [2022-12-06 00:48:04,032 INFO L131 PetriNetUnfolder]: For 48393/48393 co-relation queries the response was YES. [2022-12-06 00:48:04,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124790 conditions, 7552 events. 4224/7552 cut-off events. For 48393/48393 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 49686 event pairs, 542 based on Foata normal form. 84/6676 useless extension candidates. Maximal degree in co-relation 114152. Up to 6366 conditions per place. [2022-12-06 00:48:04,076 INFO L137 encePairwiseOnDemand]: 38/65 looper letters, 750 selfloop transitions, 101 changer transitions 297/1149 dead transitions. [2022-12-06 00:48:04,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1149 transitions, 42324 flow [2022-12-06 00:48:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:48:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:48:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 274 transitions. [2022-12-06 00:48:04,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18327759197324414 [2022-12-06 00:48:04,078 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2022-12-06 00:48:04,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:48:04,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 1149 transitions, 42324 flow [2022-12-06 00:48:04,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 1149 transitions, 42324 flow [2022-12-06 00:48:04,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 00:48:04,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:48:04,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 00:48:04,155 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 1149 transitions, 42324 flow [2022-12-06 00:48:04,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:48:04,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:48:04,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:48:04,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:48:04,155 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:48:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:48:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -709829926, now seen corresponding path program 2 times [2022-12-06 00:48:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:48:04,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863910531] [2022-12-06 00:48:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:48:04,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:48:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:48:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:48:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:48:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863910531] [2022-12-06 00:48:06,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863910531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:48:06,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:48:06,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-06 00:48:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071802861] [2022-12-06 00:48:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:48:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:48:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:48:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:48:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:48:06,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 00:48:06,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1149 transitions, 42324 flow. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:48:06,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:48:06,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 00:48:06,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:48:13,915 INFO L130 PetriNetUnfolder]: 4752/8491 cut-off events. [2022-12-06 00:48:13,915 INFO L131 PetriNetUnfolder]: For 58020/58020 co-relation queries the response was YES. [2022-12-06 00:48:13,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148321 conditions, 8491 events. 4752/8491 cut-off events. For 58020/58020 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 57461 event pairs, 548 based on Foata normal form. 58/7493 useless extension candidates. Maximal degree in co-relation 135156. Up to 7210 conditions per place. [2022-12-06 00:48:13,968 INFO L137 encePairwiseOnDemand]: 35/65 looper letters, 843 selfloop transitions, 149 changer transitions 362/1355 dead transitions. [2022-12-06 00:48:13,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1355 transitions, 52455 flow [2022-12-06 00:48:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 00:48:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 00:48:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 292 transitions. [2022-12-06 00:48:13,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17969230769230768 [2022-12-06 00:48:13,972 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 172 predicate places. [2022-12-06 00:48:13,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:48:13,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 1355 transitions, 52455 flow [2022-12-06 00:48:14,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 1355 transitions, 52455 flow [2022-12-06 00:48:14,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 00:48:14,188 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:48:14,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:48:14,189 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 1355 transitions, 52455 flow [2022-12-06 00:48:14,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:48:14,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:48:14,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:48:14,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:48:14,189 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:48:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:48:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash 15688350, now seen corresponding path program 3 times [2022-12-06 00:48:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:48:14,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340771353] [2022-12-06 00:48:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:48:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:48:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:48:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:48:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:48:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340771353] [2022-12-06 00:48:17,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340771353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:48:17,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:48:17,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-06 00:48:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475939364] [2022-12-06 00:48:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:48:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:48:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:48:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:48:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:48:17,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-06 00:48:17,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1355 transitions, 52455 flow. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:48:17,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:48:17,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-06 00:48:17,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:48:26,536 INFO L130 PetriNetUnfolder]: 5104/9158 cut-off events. [2022-12-06 00:48:26,537 INFO L131 PetriNetUnfolder]: For 63398/63398 co-relation queries the response was YES. [2022-12-06 00:48:26,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168526 conditions, 9158 events. 5104/9158 cut-off events. For 63398/63398 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63385 event pairs, 592 based on Foata normal form. 32/8086 useless extension candidates. Maximal degree in co-relation 152630. Up to 7865 conditions per place. [2022-12-06 00:48:26,590 INFO L137 encePairwiseOnDemand]: 35/65 looper letters, 911 selfloop transitions, 179 changer transitions 411/1502 dead transitions. [2022-12-06 00:48:26,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1502 transitions, 61115 flow [2022-12-06 00:48:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 00:48:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 00:48:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 299 transitions. [2022-12-06 00:48:26,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17692307692307693 [2022-12-06 00:48:26,592 INFO L294 CegarLoopForPetriNet]: 68 programPoint places, 197 predicate places. [2022-12-06 00:48:26,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:48:26,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1502 transitions, 61115 flow [2022-12-06 00:48:26,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 1502 transitions, 61115 flow [2022-12-06 00:48:26,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:48:26,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:48:26,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 00:48:26,683 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 1502 transitions, 61115 flow [2022-12-06 00:48:26,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:48:26,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:48:26,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:48:26,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:48:26,683 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:48:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:48:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1662941587, now seen corresponding path program 2 times [2022-12-06 00:48:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:48:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83221813] [2022-12-06 00:48:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:48:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:48:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-06 01:00:14,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 01:00:14,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 01:00:14,228 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 01:00:14,248 INFO L158 Benchmark]: Toolchain (without parser) took 816416.68ms. Allocated memory was 220.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 194.0MB in the beginning and 716.1MB in the end (delta: -522.1MB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-12-06 01:00:14,248 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:00:14,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.53ms. Allocated memory is still 220.2MB. Free memory was 193.5MB in the beginning and 163.8MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 01:00:14,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 220.2MB. Free memory was 163.8MB in the beginning and 160.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:00:14,249 INFO L158 Benchmark]: Boogie Preprocessor took 39.50ms. Allocated memory is still 220.2MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:00:14,249 INFO L158 Benchmark]: RCFGBuilder took 513.23ms. Allocated memory is still 220.2MB. Free memory was 158.0MB in the beginning and 135.5MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 01:00:14,249 INFO L158 Benchmark]: TraceAbstraction took 815224.22ms. Allocated memory was 220.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 134.9MB in the beginning and 716.1MB in the end (delta: -581.1MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. [2022-12-06 01:00:14,250 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.10ms. Allocated memory is still 220.2MB. Free memory is still 196.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 573.53ms. Allocated memory is still 220.2MB. Free memory was 193.5MB in the beginning and 163.8MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 220.2MB. Free memory was 163.8MB in the beginning and 160.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.50ms. Allocated memory is still 220.2MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.23ms. Allocated memory is still 220.2MB. Free memory was 158.0MB in the beginning and 135.5MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 815224.22ms. Allocated memory was 220.2MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 134.9MB in the beginning and 716.1MB in the end (delta: -581.1MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 237 PlacesBefore, 68 PlacesAfterwards, 245 TransitionsBefore, 72 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 123 ConcurrentYvCompositions, 5 ChoiceCompositions, 192 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 10403, independent unconditional: 0, dependent: 388, dependent conditional: 388, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10791, independent: 10403, independent conditional: 0, independent unconditional: 10403, dependent: 388, dependent conditional: 0, dependent unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8952, independent: 8822, independent conditional: 0, independent unconditional: 8822, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8952, independent: 8795, independent conditional: 0, independent unconditional: 8795, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 157, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 226, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10791, independent: 1581, independent conditional: 0, independent unconditional: 1581, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 8952, unknown conditional: 0, unknown unconditional: 8952] , Statistics on independence cache: Total cache size (in pairs): 14712, Positive cache size: 14582, Positive conditional cache size: 0, Positive unconditional cache size: 14582, Negative cache size: 130, Negative conditional cache size: 0, Negative unconditional cache size: 130, 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, 66 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 61 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 70 PlacesBefore, 67 PlacesAfterwards, 109 TransitionsBefore, 106 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 72 PlacesBefore, 73 PlacesAfterwards, 132 TransitionsBefore, 134 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 80 PlacesBefore, 78 PlacesAfterwards, 145 TransitionsBefore, 143 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 85 PlacesBefore, 86 PlacesAfterwards, 200 TransitionsBefore, 201 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 94 PlacesBefore, 94 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 327 TransitionsBefore, 327 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 358 TransitionsBefore, 358 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 628 TransitionsBefore, 628 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 637 TransitionsBefore, 637 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 1049 TransitionsBefore, 1049 TransitionsAfterwards, 1490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 144 PlacesBefore, 144 PlacesAfterwards, 595 TransitionsBefore, 595 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 154 PlacesBefore, 154 PlacesAfterwards, 620 TransitionsBefore, 620 TransitionsAfterwards, 882 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 698 TransitionsBefore, 698 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 831 TransitionsBefore, 831 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 194 PlacesBefore, 194 PlacesAfterwards, 909 TransitionsBefore, 909 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 216 PlacesBefore, 216 PlacesAfterwards, 1149 TransitionsBefore, 1149 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 240 PlacesBefore, 240 PlacesAfterwards, 1355 TransitionsBefore, 1355 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 265 PlacesBefore, 265 PlacesAfterwards, 1502 TransitionsBefore, 1502 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown