/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-a802222-m [2022-12-13 02:45:21,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:45:21,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:45:21,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:45:21,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:45:21,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:45:21,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:45:21,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:45:21,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:45:21,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:45:21,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:45:21,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:45:21,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:45:21,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:45:21,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:45:21,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:45:21,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:45:21,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:45:21,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:45:21,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:45:21,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:45:21,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:45:21,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:45:21,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:45:21,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:45:21,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:45:21,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:45:21,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:45:21,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:45:21,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:45:21,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:45:21,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:45:21,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:45:21,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:45:21,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:45:21,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:45:21,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:45:21,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:45:21,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:45:21,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:45:21,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:45:21,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:45:21,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:45:21,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:45:21,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:45:21,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:45:21,961 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:45:21,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:45:21,962 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:45:21,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:45:21,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:45:21,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:45:21,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:45:21,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:45:21,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:45:21,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:45:21,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:45:21,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:45:21,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 02:45:22,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:45:22,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:45:22,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:45:22,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:45:22,277 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:45:22,277 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-13 02:45:23,272 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:45:23,648 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:45:23,648 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-12-13 02:45:23,679 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c069060/5de346c9d4dd4f4695a3925982285eb6/FLAGe3656bffe [2022-12-13 02:45:23,691 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c069060/5de346c9d4dd4f4695a3925982285eb6 [2022-12-13 02:45:23,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:45:23,693 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:45:23,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:45:23,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:45:23,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:45:23,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:23" (1/1) ... [2022-12-13 02:45:23,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2c95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:23, skipping insertion in model container [2022-12-13 02:45:23,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:45:23" (1/1) ... [2022-12-13 02:45:23,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:45:23,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:45:24,067 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-13 02:45:24,074 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-13 02:45:24,078 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-13 02:45:24,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:45:24,092 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:45:24,126 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-13 02:45:24,127 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-13 02:45:24,129 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-13 02:45:24,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:45:24,177 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:45:24,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24 WrapperNode [2022-12-13 02:45:24,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:45:24,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:45:24,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:45:24,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:45:24,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,220 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-13 02:45:24,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:45:24,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:45:24,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:45:24,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:45:24,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:45:24,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:45:24,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:45:24,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:45:24,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (1/1) ... [2022-12-13 02:45:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:45:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:45:24,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 02:45:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 02:45:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 02:45:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 02:45:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 02:45:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:45:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:45:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:45:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:45:24,336 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 02:45:24,497 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:45:24,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:45:24,852 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:45:24,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:45:24,862 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 02:45:24,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:24 BoogieIcfgContainer [2022-12-13 02:45:24,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:45:24,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:45:24,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:45:24,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:45:24,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:45:23" (1/3) ... [2022-12-13 02:45:24,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17407bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:24, skipping insertion in model container [2022-12-13 02:45:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:45:24" (2/3) ... [2022-12-13 02:45:24,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17407bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:45:24, skipping insertion in model container [2022-12-13 02:45:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:45:24" (3/3) ... [2022-12-13 02:45:24,869 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-13 02:45:24,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:45:24,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 02:45:24,885 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:45:25,004 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:45:25,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-13 02:45:25,133 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-13 02:45:25,133 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:45:25,141 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-13 02:45:25,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-13 02:45:25,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-13 02:45:25,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:25,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-13 02:45:25,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 245 transitions, 499 flow [2022-12-13 02:45:25,223 INFO L130 PetriNetUnfolder]: 15/245 cut-off events. [2022-12-13 02:45:25,223 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 02:45:25,228 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-13 02:45:25,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 245 transitions, 499 flow [2022-12-13 02:45:25,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-13 02:45:34,217 INFO L241 LiptonReduction]: Total number of compositions: 209 [2022-12-13 02:45:34,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:45:34,236 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;@76b05d5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:45:34,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 02:45:34,238 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 02:45:34,238 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:45:34,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:34,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 02:45:34,239 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-13 02:45:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1091, now seen corresponding path program 1 times [2022-12-13 02:45:34,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:34,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121499879] [2022-12-13 02:45:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121499879] [2022-12-13 02:45:34,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121499879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:34,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:34,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 02:45:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318288714] [2022-12-13 02:45:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 02:45:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 02:45:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 02:45:34,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 186 [2022-12-13 02:45:34,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 186 transitions, 381 flow. Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:34,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:34,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 186 [2022-12-13 02:45:34,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:36,324 INFO L130 PetriNetUnfolder]: 21447/35704 cut-off events. [2022-12-13 02:45:36,325 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-13 02:45:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69510 conditions, 35704 events. 21447/35704 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 272428 event pairs, 19930 based on Foata normal form. 137/12742 useless extension candidates. Maximal degree in co-relation 69052. Up to 33577 conditions per place. [2022-12-13 02:45:36,440 INFO L137 encePairwiseOnDemand]: 176/186 looper letters, 149 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2022-12-13 02:45:36,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 02:45:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 02:45:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 213 transitions. [2022-12-13 02:45:36,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2022-12-13 02:45:36,455 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -5 predicate places. [2022-12-13 02:45:36,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:36,638 INFO L89 Accepts]: Start accepts. Operand has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:36,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:36,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 4236 [2022-12-13 02:45:36,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:45:36,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:45:36,757 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 176 transitions, 659 flow [2022-12-13 02:45:36,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:36,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:36,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:36,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:45:36,757 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-13 02:45:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1124677344, now seen corresponding path program 1 times [2022-12-13 02:45:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:36,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246204519] [2022-12-13 02:45:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:36,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246204519] [2022-12-13 02:45:37,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246204519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:37,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:37,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:45:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564256058] [2022-12-13 02:45:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:37,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:45:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:45:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:45:37,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 176 [2022-12-13 02:45:37,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 176 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:37,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:37,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 176 [2022-12-13 02:45:37,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:38,536 INFO L130 PetriNetUnfolder]: 15162/25443 cut-off events. [2022-12-13 02:45:38,536 INFO L131 PetriNetUnfolder]: For 514/678 co-relation queries the response was YES. [2022-12-13 02:45:38,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73836 conditions, 25443 events. 15162/25443 cut-off events. For 514/678 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 173373 event pairs, 9031 based on Foata normal form. 544/9891 useless extension candidates. Maximal degree in co-relation 73033. Up to 23829 conditions per place. [2022-12-13 02:45:38,688 INFO L137 encePairwiseOnDemand]: 166/176 looper letters, 133 selfloop transitions, 3 changer transitions 76/236 dead transitions. [2022-12-13 02:45:38,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 236 transitions, 1327 flow [2022-12-13 02:45:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:45:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:45:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-12-13 02:45:38,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2022-12-13 02:45:38,694 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -3 predicate places. [2022-12-13 02:45:38,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 236 transitions, 1327 flow [2022-12-13 02:45:38,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 160 transitions, 873 flow [2022-12-13 02:45:38,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:38,803 INFO L89 Accepts]: Start accepts. Operand has 113 places, 160 transitions, 873 flow [2022-12-13 02:45:38,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:38,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:38,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 160 transitions, 873 flow [2022-12-13 02:45:38,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 160 transitions, 873 flow [2022-12-13 02:45:38,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 2464 [2022-12-13 02:45:38,839 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:45:38,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 02:45:38,842 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 160 transitions, 873 flow [2022-12-13 02:45:38,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:38,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:38,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:38,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:45:38,842 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-13 02:45:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash -994560421, now seen corresponding path program 1 times [2022-12-13 02:45:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130698834] [2022-12-13 02:45:38,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:39,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130698834] [2022-12-13 02:45:39,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130698834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:39,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:39,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:45:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912439642] [2022-12-13 02:45:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:45:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:45:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:45:39,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 02:45:39,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 160 transitions, 873 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:39,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:39,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 02:45:39,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:41,103 INFO L130 PetriNetUnfolder]: 7502/13346 cut-off events. [2022-12-13 02:45:41,103 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-13 02:45:41,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50002 conditions, 13346 events. 7502/13346 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 86613 event pairs, 4266 based on Foata normal form. 38/6701 useless extension candidates. Maximal degree in co-relation 49449. Up to 12292 conditions per place. [2022-12-13 02:45:41,266 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 152 selfloop transitions, 9 changer transitions 30/210 dead transitions. [2022-12-13 02:45:41,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 210 transitions, 1542 flow [2022-12-13 02:45:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:45:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:45:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2022-12-13 02:45:41,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2022-12-13 02:45:41,270 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -60 predicate places. [2022-12-13 02:45:41,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 210 transitions, 1542 flow [2022-12-13 02:45:41,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 180 transitions, 1327 flow [2022-12-13 02:45:41,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:41,350 INFO L89 Accepts]: Start accepts. Operand has 114 places, 180 transitions, 1327 flow [2022-12-13 02:45:41,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:41,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:41,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 180 transitions, 1327 flow [2022-12-13 02:45:41,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 180 transitions, 1327 flow [2022-12-13 02:45:41,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 02:45:41,475 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:45:41,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:45:41,477 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 180 transitions, 1327 flow [2022-12-13 02:45:41,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:41,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:41,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:41,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:45:41,478 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-13 02:45:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 634737586, now seen corresponding path program 1 times [2022-12-13 02:45:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083448373] [2022-12-13 02:45:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:41,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-13 02:45:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:41,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083448373] [2022-12-13 02:45:41,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083448373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:41,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:41,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:45:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940858940] [2022-12-13 02:45:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:41,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:45:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:45:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:45:41,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 107 [2022-12-13 02:45:41,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 180 transitions, 1327 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:41,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:41,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 107 [2022-12-13 02:45:41,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:43,155 INFO L130 PetriNetUnfolder]: 7684/13598 cut-off events. [2022-12-13 02:45:43,155 INFO L131 PetriNetUnfolder]: For 1196/1196 co-relation queries the response was YES. [2022-12-13 02:45:43,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63976 conditions, 13598 events. 7684/13598 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 88454 event pairs, 1253 based on Foata normal form. 34/6829 useless extension candidates. Maximal degree in co-relation 63298. Up to 12634 conditions per place. [2022-12-13 02:45:43,211 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 211 selfloop transitions, 13 changer transitions 15/258 dead transitions. [2022-12-13 02:45:43,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 258 transitions, 2440 flow [2022-12-13 02:45:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:45:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:45:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2022-12-13 02:45:43,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41388518024032045 [2022-12-13 02:45:43,213 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -61 predicate places. [2022-12-13 02:45:43,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 258 transitions, 2440 flow [2022-12-13 02:45:43,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 243 transitions, 2287 flow [2022-12-13 02:45:43,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:43,307 INFO L89 Accepts]: Start accepts. Operand has 119 places, 243 transitions, 2287 flow [2022-12-13 02:45:43,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:43,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:43,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 243 transitions, 2287 flow [2022-12-13 02:45:43,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 243 transitions, 2287 flow [2022-12-13 02:45:43,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 2186 [2022-12-13 02:45:43,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:45:43,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 02:45:43,548 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 243 transitions, 2299 flow [2022-12-13 02:45:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:43,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:43,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:43,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:45:43,548 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-13 02:45:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1427338590, now seen corresponding path program 2 times [2022-12-13 02:45:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:43,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369111000] [2022-12-13 02:45:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:43,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369111000] [2022-12-13 02:45:43,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369111000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:43,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:43,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:45:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514588379] [2022-12-13 02:45:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:43,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:45:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:45:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:45:43,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 02:45:43,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 243 transitions, 2299 flow. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:43,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:43,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 02:45:43,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:45,320 INFO L130 PetriNetUnfolder]: 7999/14144 cut-off events. [2022-12-13 02:45:45,320 INFO L131 PetriNetUnfolder]: For 1436/1436 co-relation queries the response was YES. [2022-12-13 02:45:45,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79749 conditions, 14144 events. 7999/14144 cut-off events. For 1436/1436 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 92469 event pairs, 3803 based on Foata normal form. 34/7186 useless extension candidates. Maximal degree in co-relation 78947. Up to 13153 conditions per place. [2022-12-13 02:45:45,368 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 254 selfloop transitions, 15 changer transitions 15/303 dead transitions. [2022-12-13 02:45:45,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 303 transitions, 3463 flow [2022-12-13 02:45:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:45:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:45:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 309 transitions. [2022-12-13 02:45:45,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4012987012987013 [2022-12-13 02:45:45,383 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -56 predicate places. [2022-12-13 02:45:45,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 303 transitions, 3463 flow [2022-12-13 02:45:45,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 288 transitions, 3280 flow [2022-12-13 02:45:45,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:45,513 INFO L89 Accepts]: Start accepts. Operand has 124 places, 288 transitions, 3280 flow [2022-12-13 02:45:45,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:45,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:45,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 288 transitions, 3280 flow [2022-12-13 02:45:45,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 288 transitions, 3280 flow [2022-12-13 02:45:45,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 2330 [2022-12-13 02:45:45,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:45:45,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 02:45:45,725 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 289 transitions, 3308 flow [2022-12-13 02:45:45,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:45,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:45,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:45,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:45:45,726 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-13 02:45:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1237610774, now seen corresponding path program 3 times [2022-12-13 02:45:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:45,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696131702] [2022-12-13 02:45:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:46,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696131702] [2022-12-13 02:45:46,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696131702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:46,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:46,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:45:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468291716] [2022-12-13 02:45:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:46,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:45:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:45:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:45:46,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 02:45:46,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 289 transitions, 3308 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:46,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:46,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 02:45:46,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:48,040 INFO L130 PetriNetUnfolder]: 10314/18323 cut-off events. [2022-12-13 02:45:48,040 INFO L131 PetriNetUnfolder]: For 3173/3173 co-relation queries the response was YES. [2022-12-13 02:45:48,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119883 conditions, 18323 events. 10314/18323 cut-off events. For 3173/3173 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 128027 event pairs, 1373 based on Foata normal form. 0/8925 useless extension candidates. Maximal degree in co-relation 118330. Up to 16955 conditions per place. [2022-12-13 02:45:48,117 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 291 selfloop transitions, 16 changer transitions 96/422 dead transitions. [2022-12-13 02:45:48,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 422 transitions, 5710 flow [2022-12-13 02:45:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:45:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:45:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 446 transitions. [2022-12-13 02:45:48,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40545454545454546 [2022-12-13 02:45:48,120 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -47 predicate places. [2022-12-13 02:45:48,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 422 transitions, 5710 flow [2022-12-13 02:45:48,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 326 transitions, 4354 flow [2022-12-13 02:45:48,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:48,252 INFO L89 Accepts]: Start accepts. Operand has 133 places, 326 transitions, 4354 flow [2022-12-13 02:45:48,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:48,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:48,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 326 transitions, 4354 flow [2022-12-13 02:45:48,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 326 transitions, 4354 flow [2022-12-13 02:45:48,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 2410 [2022-12-13 02:45:52,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:45:52,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3822 [2022-12-13 02:45:52,074 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 327 transitions, 4378 flow [2022-12-13 02:45:52,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:52,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:52,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:52,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:45:52,075 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-13 02:45:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -819053094, now seen corresponding path program 1 times [2022-12-13 02:45:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:52,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397236924] [2022-12-13 02:45:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:45:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:45:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:45:52,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397236924] [2022-12-13 02:45:52,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397236924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:45:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:45:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:45:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572319007] [2022-12-13 02:45:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:45:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:45:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:45:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:45:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:45:52,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 110 [2022-12-13 02:45:52,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 327 transitions, 4378 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:52,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:45:52,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 110 [2022-12-13 02:45:52,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:45:54,051 INFO L130 PetriNetUnfolder]: 7236/13906 cut-off events. [2022-12-13 02:45:54,051 INFO L131 PetriNetUnfolder]: For 4198/4198 co-relation queries the response was YES. [2022-12-13 02:45:54,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101691 conditions, 13906 events. 7236/13906 cut-off events. For 4198/4198 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 100941 event pairs, 1319 based on Foata normal form. 0/8021 useless extension candidates. Maximal degree in co-relation 100946. Up to 12565 conditions per place. [2022-12-13 02:45:54,107 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 283 selfloop transitions, 18 changer transitions 25/345 dead transitions. [2022-12-13 02:45:54,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 345 transitions, 5268 flow [2022-12-13 02:45:54,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:45:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:45:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2022-12-13 02:45:54,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2872727272727273 [2022-12-13 02:45:54,109 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -38 predicate places. [2022-12-13 02:45:54,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 345 transitions, 5268 flow [2022-12-13 02:45:54,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 320 transitions, 4868 flow [2022-12-13 02:45:54,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:45:54,222 INFO L89 Accepts]: Start accepts. Operand has 139 places, 320 transitions, 4868 flow [2022-12-13 02:45:54,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:45:54,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:45:54,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 320 transitions, 4868 flow [2022-12-13 02:45:54,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 320 transitions, 4868 flow [2022-12-13 02:45:54,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 2314 [2022-12-13 02:45:54,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] 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_144| |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_144|, 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_144|, 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 [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} 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-13 02:45:54,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [987] L1010-1-->L980-1: Formula: (and (= (select (select |v_#memory_int_698| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_267|) (+ |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_61| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_267| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267|)) InVars {t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|, #memory_int=|v_#memory_int_698|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_267|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_109|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_113|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_49|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_267|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_49|, #memory_int=|v_#memory_int_698|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_61|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_57|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_145|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_49|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_125|} 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 [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} 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-13 02:45:54,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L988-->L988-2: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37| (select (select |v_#memory_int_142| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|) (+ 1604 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|))) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|)) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|, #memory_int=|v_#memory_int_142|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_73|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_73|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_33|, #memory_int=|v_#memory_int_142|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1] and [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} 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-13 02:45:54,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1029] $Ultimate##0-->L1010-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_244| |v_~#m~0.base_120|))) (and (= |v_t1Thread1of1ForFork0_~value~0#1_121| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_63|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_36| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_65| |v_~#queue~0.base_129|) (= |v_#pthreadsMutex_243| (store |v_#pthreadsMutex_244| |v_~#m~0.base_120| (store .cse0 |v_~#m~0.offset_120| 1))) (= |v_t1Thread1of1ForFork0_~value~0#1_121| |v_t1Thread1of1ForFork0_#t~nondet50#1_36|) (= (select .cse0 |v_~#m~0.offset_120|) 0) (= |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|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_36| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_65| |v_~#queue~0.offset_124|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_244|, ~#m~0.base=|v_~#m~0.base_120|, ~#queue~0.base=|v_~#queue~0.base_129|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_36|, ~#m~0.offset=|v_~#m~0.offset_120|, ~#queue~0.offset=|v_~#queue~0.offset_124|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_243|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_83|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_33|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_121|, 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_65|, ~#m~0.base=|v_~#m~0.base_120|, ~#queue~0.base=|v_~#queue~0.base_129|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_63|, ~#m~0.offset=|v_~#m~0.offset_120|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_37|, ~#queue~0.offset=|v_~#queue~0.offset_124|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_33|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_65|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_33|} 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 [955] L1062-4-->L1063-3: Formula: (and (= (store |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19| (store (select |v_#memory_int_539| |v_ULTIMATE.start_main_~#id2~0#1.base_19|) |v_ULTIMATE.start_main_~#id2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre64#1_25|)) |v_#memory_int_538|) (= |v_ULTIMATE.start_main_#t~pre64#1_25| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_539|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_31|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_19|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_25|, #memory_int=|v_#memory_int_538|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_13|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_19|} 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-13 02:45:54,733 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:45:54,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-13 02:45:54,733 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 316 transitions, 4812 flow [2022-12-13 02:45:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:45:54,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:45:54,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:45:54,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:45:54,734 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-13 02:45:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:45:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1621160402, now seen corresponding path program 1 times [2022-12-13 02:45:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:45:54,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288760309] [2022-12-13 02:45:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:45:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:45:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:00,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:00,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288760309] [2022-12-13 02:46:00,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288760309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:00,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:00,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:46:00,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916542659] [2022-12-13 02:46:00,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:46:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:46:00,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:46:00,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 112 [2022-12-13 02:46:00,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 316 transitions, 4812 flow. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:00,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:00,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 112 [2022-12-13 02:46:00,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:42,835 INFO L130 PetriNetUnfolder]: 8100/15291 cut-off events. [2022-12-13 02:46:42,835 INFO L131 PetriNetUnfolder]: For 5180/5180 co-relation queries the response was YES. [2022-12-13 02:46:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124998 conditions, 15291 events. 8100/15291 cut-off events. For 5180/5180 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 112585 event pairs, 1688 based on Foata normal form. 0/9207 useless extension candidates. Maximal degree in co-relation 124204. Up to 13794 conditions per place. [2022-12-13 02:46:42,901 INFO L137 encePairwiseOnDemand]: 94/112 looper letters, 348 selfloop transitions, 28 changer transitions 50/445 dead transitions. [2022-12-13 02:46:42,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 445 transitions, 7743 flow [2022-12-13 02:46:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:46:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:46:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 409 transitions. [2022-12-13 02:46:42,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3651785714285714 [2022-12-13 02:46:42,904 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -39 predicate places. [2022-12-13 02:46:42,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 445 transitions, 7743 flow [2022-12-13 02:46:42,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 395 transitions, 6843 flow [2022-12-13 02:46:43,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:43,033 INFO L89 Accepts]: Start accepts. Operand has 142 places, 395 transitions, 6843 flow [2022-12-13 02:46:43,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:43,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:43,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 395 transitions, 6843 flow [2022-12-13 02:46:43,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 395 transitions, 6843 flow [2022-12-13 02:46:43,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 2772 [2022-12-13 02:46:43,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:43,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-13 02:46:43,308 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 396 transitions, 6891 flow [2022-12-13 02:46:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:43,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:43,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 02:46:43,309 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-13 02:46:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash 525214365, now seen corresponding path program 1 times [2022-12-13 02:46:43,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:43,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570658544] [2022-12-13 02:46:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:43,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:43,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570658544] [2022-12-13 02:46:43,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570658544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:43,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:43,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:46:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272626560] [2022-12-13 02:46:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:46:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:46:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:46:43,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 117 [2022-12-13 02:46:43,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 396 transitions, 6891 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:43,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:43,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 117 [2022-12-13 02:46:43,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:45,440 INFO L130 PetriNetUnfolder]: 7900/15003 cut-off events. [2022-12-13 02:46:45,441 INFO L131 PetriNetUnfolder]: For 6505/6505 co-relation queries the response was YES. [2022-12-13 02:46:45,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135952 conditions, 15003 events. 7900/15003 cut-off events. For 6505/6505 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 110440 event pairs, 1466 based on Foata normal form. 0/9043 useless extension candidates. Maximal degree in co-relation 135052. Up to 13501 conditions per place. [2022-12-13 02:46:45,509 INFO L137 encePairwiseOnDemand]: 104/117 looper letters, 392 selfloop transitions, 15 changer transitions 15/441 dead transitions. [2022-12-13 02:46:45,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 441 transitions, 8520 flow [2022-12-13 02:46:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:46:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:46:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 278 transitions. [2022-12-13 02:46:45,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.396011396011396 [2022-12-13 02:46:45,521 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -33 predicate places. [2022-12-13 02:46:45,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 441 transitions, 8520 flow [2022-12-13 02:46:45,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 426 transitions, 8220 flow [2022-12-13 02:46:45,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:45,667 INFO L89 Accepts]: Start accepts. Operand has 147 places, 426 transitions, 8220 flow [2022-12-13 02:46:45,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:45,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:45,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 426 transitions, 8220 flow [2022-12-13 02:46:45,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 426 transitions, 8220 flow [2022-12-13 02:46:45,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-13 02:46:45,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:45,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 02:46:45,768 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 427 transitions, 8246 flow [2022-12-13 02:46:45,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:45,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:45,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:45,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:46:45,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:46:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2077252270, now seen corresponding path program 1 times [2022-12-13 02:46:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:45,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176510274] [2022-12-13 02:46:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:46,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176510274] [2022-12-13 02:46:46,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176510274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:46,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:46,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:46:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479632579] [2022-12-13 02:46:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:46,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:46:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:46:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:46:46,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 113 [2022-12-13 02:46:46,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 427 transitions, 8246 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:46,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:46,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 113 [2022-12-13 02:46:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:48,532 INFO L130 PetriNetUnfolder]: 8095/15356 cut-off events. [2022-12-13 02:46:48,532 INFO L131 PetriNetUnfolder]: For 7940/7940 co-relation queries the response was YES. [2022-12-13 02:46:48,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152828 conditions, 15356 events. 8095/15356 cut-off events. For 7940/7940 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 113493 event pairs, 1879 based on Foata normal form. 0/9314 useless extension candidates. Maximal degree in co-relation 151844. Up to 13803 conditions per place. [2022-12-13 02:46:48,626 INFO L137 encePairwiseOnDemand]: 96/113 looper letters, 411 selfloop transitions, 24 changer transitions 37/491 dead transitions. [2022-12-13 02:46:48,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 491 transitions, 10472 flow [2022-12-13 02:46:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:46:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:46:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 344 transitions. [2022-12-13 02:46:48,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3805309734513274 [2022-12-13 02:46:48,629 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -26 predicate places. [2022-12-13 02:46:48,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 491 transitions, 10472 flow [2022-12-13 02:46:48,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 454 transitions, 9658 flow [2022-12-13 02:46:48,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:48,818 INFO L89 Accepts]: Start accepts. Operand has 154 places, 454 transitions, 9658 flow [2022-12-13 02:46:48,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:48,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:48,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 454 transitions, 9658 flow [2022-12-13 02:46:48,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 454 transitions, 9658 flow [2022-12-13 02:46:48,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 3126 [2022-12-13 02:46:48,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:48,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 02:46:48,970 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 454 transitions, 9670 flow [2022-12-13 02:46:48,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:48,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:48,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:48,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:46:48,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:46:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2078175791, now seen corresponding path program 1 times [2022-12-13 02:46:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:48,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848584113] [2022-12-13 02:46:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:49,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848584113] [2022-12-13 02:46:49,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848584113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:49,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:49,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 02:46:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904831102] [2022-12-13 02:46:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:49,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:46:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:46:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:46:49,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 114 [2022-12-13 02:46:49,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 454 transitions, 9670 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:49,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:49,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 114 [2022-12-13 02:46:49,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:51,517 INFO L130 PetriNetUnfolder]: 7693/14423 cut-off events. [2022-12-13 02:46:51,517 INFO L131 PetriNetUnfolder]: For 9323/9323 co-relation queries the response was YES. [2022-12-13 02:46:51,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156654 conditions, 14423 events. 7693/14423 cut-off events. For 9323/9323 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 103627 event pairs, 1341 based on Foata normal form. 0/8830 useless extension candidates. Maximal degree in co-relation 155610. Up to 12972 conditions per place. [2022-12-13 02:46:51,599 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 441 selfloop transitions, 22 changer transitions 21/503 dead transitions. [2022-12-13 02:46:51,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 503 transitions, 11709 flow [2022-12-13 02:46:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:46:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:46:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2022-12-13 02:46:51,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39097744360902253 [2022-12-13 02:46:51,601 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -21 predicate places. [2022-12-13 02:46:51,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 503 transitions, 11709 flow [2022-12-13 02:46:51,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 482 transitions, 11205 flow [2022-12-13 02:46:51,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:51,782 INFO L89 Accepts]: Start accepts. Operand has 160 places, 482 transitions, 11205 flow [2022-12-13 02:46:51,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:51,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:51,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 482 transitions, 11205 flow [2022-12-13 02:46:51,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 482 transitions, 11205 flow [2022-12-13 02:46:51,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 3304 [2022-12-13 02:46:51,997 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:51,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 02:46:51,998 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 483 transitions, 11249 flow [2022-12-13 02:46:51,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:51,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:51,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:51,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 02:46:51,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 02:46:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2051272703, now seen corresponding path program 1 times [2022-12-13 02:46:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:51,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128414522] [2022-12-13 02:46:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:52,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128414522] [2022-12-13 02:46:52,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128414522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:52,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:52,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 02:46:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242507922] [2022-12-13 02:46:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:46:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:46:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:46:52,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 115 [2022-12-13 02:46:52,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 483 transitions, 11249 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:52,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:52,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 115 [2022-12-13 02:46:52,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:55,169 INFO L130 PetriNetUnfolder]: 7455/14112 cut-off events. [2022-12-13 02:46:55,169 INFO L131 PetriNetUnfolder]: For 11280/11280 co-relation queries the response was YES. [2022-12-13 02:46:55,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166332 conditions, 14112 events. 7455/14112 cut-off events. For 11280/11280 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 102415 event pairs, 1285 based on Foata normal form. 0/8667 useless extension candidates. Maximal degree in co-relation 165177. Up to 12720 conditions per place. [2022-12-13 02:46:55,262 INFO L137 encePairwiseOnDemand]: 95/115 looper letters, 381 selfloop transitions, 47 changer transitions 86/532 dead transitions. [2022-12-13 02:46:55,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 532 transitions, 13467 flow [2022-12-13 02:46:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:46:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:46:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 389 transitions. [2022-12-13 02:46:55,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3382608695652174 [2022-12-13 02:46:55,264 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -13 predicate places. [2022-12-13 02:46:55,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 532 transitions, 13467 flow [2022-12-13 02:46:55,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 446 transitions, 11231 flow [2022-12-13 02:46:55,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:55,446 INFO L89 Accepts]: Start accepts. Operand has 159 places, 446 transitions, 11231 flow [2022-12-13 02:46:55,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:55,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:55,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 446 transitions, 11231 flow [2022-12-13 02:46:55,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 446 transitions, 11231 flow [2022-12-13 02:46:55,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 3140 [2022-12-13 02:46:55,602 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:55,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 02:46:55,604 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 446 transitions, 11243 flow [2022-12-13 02:46:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:55,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:55,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:55,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 02:46:55,605 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-13 02:46:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 558819257, now seen corresponding path program 1 times [2022-12-13 02:46:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361638067] [2022-12-13 02:46:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:55,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361638067] [2022-12-13 02:46:55,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361638067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:55,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:55,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:46:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305239742] [2022-12-13 02:46:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:55,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:46:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:55,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:46:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:46:55,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 105 [2022-12-13 02:46:55,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 446 transitions, 11243 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:55,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:55,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 105 [2022-12-13 02:46:55,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:56,635 INFO L130 PetriNetUnfolder]: 2177/4376 cut-off events. [2022-12-13 02:46:56,636 INFO L131 PetriNetUnfolder]: For 15604/15604 co-relation queries the response was YES. [2022-12-13 02:46:56,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53812 conditions, 4376 events. 2177/4376 cut-off events. For 15604/15604 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 27389 event pairs, 95 based on Foata normal form. 426/3585 useless extension candidates. Maximal degree in co-relation 52903. Up to 3793 conditions per place. [2022-12-13 02:46:56,657 INFO L137 encePairwiseOnDemand]: 88/105 looper letters, 291 selfloop transitions, 66 changer transitions 38/426 dead transitions. [2022-12-13 02:46:56,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 426 transitions, 11526 flow [2022-12-13 02:46:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:46:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:46:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-12-13 02:46:56,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2022-12-13 02:46:56,660 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -20 predicate places. [2022-12-13 02:46:56,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 426 transitions, 11526 flow [2022-12-13 02:46:56,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 388 transitions, 10492 flow [2022-12-13 02:46:56,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:56,717 INFO L89 Accepts]: Start accepts. Operand has 136 places, 388 transitions, 10492 flow [2022-12-13 02:46:56,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:56,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:56,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 388 transitions, 10492 flow [2022-12-13 02:46:56,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 388 transitions, 10492 flow [2022-12-13 02:46:56,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 1820 [2022-12-13 02:46:56,746 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:56,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 02:46:56,747 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 388 transitions, 10492 flow [2022-12-13 02:46:56,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:56,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:56,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 02:46:56,747 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-13 02:46:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1698954930, now seen corresponding path program 1 times [2022-12-13 02:46:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:56,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298330662] [2022-12-13 02:46:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:57,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298330662] [2022-12-13 02:46:57,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298330662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:57,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:57,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 02:46:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276138077] [2022-12-13 02:46:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:46:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:46:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:46:57,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-13 02:46:57,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 388 transitions, 10492 flow. Second operand has 13 states, 13 states have (on average 18.153846153846153) internal successors, (236), 13 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:57,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:57,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-13 02:46:57,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:46:58,595 INFO L130 PetriNetUnfolder]: 1874/3675 cut-off events. [2022-12-13 02:46:58,596 INFO L131 PetriNetUnfolder]: For 13546/13546 co-relation queries the response was YES. [2022-12-13 02:46:58,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49015 conditions, 3675 events. 1874/3675 cut-off events. For 13546/13546 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 21327 event pairs, 66 based on Foata normal form. 0/2884 useless extension candidates. Maximal degree in co-relation 47563. Up to 3233 conditions per place. [2022-12-13 02:46:58,619 INFO L137 encePairwiseOnDemand]: 57/78 looper letters, 434 selfloop transitions, 33 changer transitions 0/483 dead transitions. [2022-12-13 02:46:58,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:46:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:46:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 362 transitions. [2022-12-13 02:46:58,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38675213675213677 [2022-12-13 02:46:58,621 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -34 predicate places. [2022-12-13 02:46:58,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:46:58,680 INFO L89 Accepts]: Start accepts. Operand has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:46:58,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:46:58,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 483 transitions, 14092 flow [2022-12-13 02:46:58,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 2168 [2022-12-13 02:46:58,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:46:58,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 02:46:58,731 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 482 transitions, 14090 flow [2022-12-13 02:46:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.153846153846153) internal successors, (236), 13 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:58,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:46:58,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:46:58,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:46:58,732 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-13 02:46:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:46:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -453583106, now seen corresponding path program 1 times [2022-12-13 02:46:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:46:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442499120] [2022-12-13 02:46:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:46:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:46:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:46:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:46:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:46:59,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442499120] [2022-12-13 02:46:59,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442499120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:46:59,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:46:59,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 02:46:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349125339] [2022-12-13 02:46:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:46:59,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:46:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:46:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:46:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:46:59,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 77 [2022-12-13 02:46:59,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 482 transitions, 14090 flow. Second operand has 13 states, 13 states have (on average 16.23076923076923) internal successors, (211), 13 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:46:59,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:46:59,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 77 [2022-12-13 02:46:59,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:47:00,802 INFO L130 PetriNetUnfolder]: 2358/4648 cut-off events. [2022-12-13 02:47:00,802 INFO L131 PetriNetUnfolder]: For 20458/20458 co-relation queries the response was YES. [2022-12-13 02:47:00,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66031 conditions, 4648 events. 2358/4648 cut-off events. For 20458/20458 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 28614 event pairs, 46 based on Foata normal form. 0/3585 useless extension candidates. Maximal degree in co-relation 63634. Up to 4085 conditions per place. [2022-12-13 02:47:00,835 INFO L137 encePairwiseOnDemand]: 59/77 looper letters, 518 selfloop transitions, 37 changer transitions 0/569 dead transitions. [2022-12-13 02:47:00,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:47:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:47:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 380 transitions. [2022-12-13 02:47:00,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37962037962037964 [2022-12-13 02:47:00,837 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -23 predicate places. [2022-12-13 02:47:00,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:47:00,917 INFO L89 Accepts]: Start accepts. Operand has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:47:00,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:47:00,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 2494 [2022-12-13 02:47:00,949 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:47:00,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 02:47:00,949 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 569 transitions, 17798 flow [2022-12-13 02:47:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.23076923076923) internal successors, (211), 13 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:47:00,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:47:00,950 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:47:00,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 02:47:00,950 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-13 02:47:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:47:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 460720449, now seen corresponding path program 1 times [2022-12-13 02:47:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:47:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118581441] [2022-12-13 02:47:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:47:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:47:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 02:58:50,357 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,360 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,361 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,362 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,362 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,363 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2022-12-13 02:58:50,366 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 02:58:50,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:58:50,367 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. [2022-12-13 02:58:50,368 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 02:58:50,368 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 02:58:50,368 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 02:58:50,369 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-13 02:58:50,369 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-13 02:58:50,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 02:58:50,370 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:58:50,386 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:58:50,386 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:58:50,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:58:50 BasicIcfg [2022-12-13 02:58:50,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:58:50,388 INFO L158 Benchmark]: Toolchain (without parser) took 806694.67ms. Allocated memory was 179.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 154.4MB in the beginning and 636.3MB in the end (delta: -481.9MB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2022-12-13 02:58:50,388 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:58:50,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.27ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 123.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 02:58:50,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.20ms. Allocated memory is still 179.3MB. Free memory was 123.7MB in the beginning and 120.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 02:58:50,389 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 179.3MB. Free memory was 120.6MB in the beginning and 118.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:58:50,389 INFO L158 Benchmark]: RCFGBuilder took 609.86ms. Allocated memory is still 179.3MB. Free memory was 118.5MB in the beginning and 95.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 02:58:50,389 INFO L158 Benchmark]: TraceAbstraction took 805522.83ms. Allocated memory was 179.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 94.9MB in the beginning and 636.3MB in the end (delta: -541.4MB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. [2022-12-13 02:58:50,390 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.08ms. Allocated memory is still 179.3MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.27ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 123.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.20ms. Allocated memory is still 179.3MB. Free memory was 123.7MB in the beginning and 120.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 179.3MB. Free memory was 120.6MB in the beginning and 118.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.86ms. Allocated memory is still 179.3MB. Free memory was 118.5MB in the beginning and 95.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 805522.83ms. Allocated memory was 179.3MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 94.9MB in the beginning and 636.3MB in the end (delta: -541.4MB). Peak memory consumption was 5.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 237 PlacesBefore, 181 PlacesAfterwards, 245 TransitionsBefore, 186 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 122 ConcurrentYvCompositions, 9 ChoiceCompositions, 209 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 28197, independent unconditional: 0, dependent: 609, dependent conditional: 609, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28806, independent: 28197, independent conditional: 0, independent unconditional: 28197, dependent: 609, dependent conditional: 0, dependent unconditional: 609, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15604, independent: 15428, independent conditional: 0, independent unconditional: 15428, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15604, independent: 15395, independent conditional: 0, independent unconditional: 15395, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 209, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28806, independent: 12769, independent conditional: 0, independent unconditional: 12769, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 15604, unknown conditional: 0, unknown unconditional: 15604] , Statistics on independence cache: Total cache size (in pairs): 34129, Positive cache size: 33953, Positive conditional cache size: 0, Positive unconditional cache size: 33953, Negative cache size: 176, Negative conditional cache size: 0, Negative unconditional cache size: 176, 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, 176 PlacesBefore, 176 PlacesAfterwards, 176 TransitionsBefore, 176 TransitionsAfterwards, 4236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 277, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 289, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 234, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 234, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 289, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 234, unknown conditional: 0, unknown unconditional: 234] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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, 113 PlacesBefore, 113 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 114 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 119 PlacesBefore, 119 PlacesAfterwards, 243 TransitionsBefore, 243 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 124 PlacesBefore, 125 PlacesAfterwards, 288 TransitionsBefore, 289 TransitionsAfterwards, 2330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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): 251, Positive cache size: 241, Positive conditional cache size: 0, Positive unconditional cache size: 241, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 133 PlacesBefore, 134 PlacesAfterwards, 326 TransitionsBefore, 327 TransitionsAfterwards, 2410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, 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: 25, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 139 PlacesBefore, 133 PlacesAfterwards, 320 TransitionsBefore, 316 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 142 PlacesBefore, 143 PlacesAfterwards, 395 TransitionsBefore, 396 TransitionsAfterwards, 2772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 147 PlacesBefore, 148 PlacesAfterwards, 426 TransitionsBefore, 427 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 154 PlacesBefore, 154 PlacesAfterwards, 454 TransitionsBefore, 454 TransitionsAfterwards, 3126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 160 PlacesBefore, 161 PlacesAfterwards, 482 TransitionsBefore, 483 TransitionsAfterwards, 3304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 159 PlacesBefore, 159 PlacesAfterwards, 446 TransitionsBefore, 446 TransitionsAfterwards, 3140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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): 267, Positive cache size: 257, Positive conditional cache size: 5, Positive unconditional cache size: 252, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 388 TransitionsBefore, 388 TransitionsAfterwards, 1820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 10, independent unconditional: 4, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 265, Positive conditional cache size: 5, Positive unconditional cache size: 260, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 147 PlacesBefore, 146 PlacesAfterwards, 483 TransitionsBefore, 482 TransitionsAfterwards, 2168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 14, independent unconditional: 4, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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: 18, independent: 18, independent conditional: 3, independent unconditional: 15, 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): 275, Positive cache size: 265, Positive conditional cache size: 5, Positive unconditional cache size: 260, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 158 PlacesBefore, 158 PlacesAfterwards, 569 TransitionsBefore, 569 TransitionsAfterwards, 2494 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): 275, Positive cache size: 265, Positive conditional cache size: 5, Positive unconditional cache size: 260, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 403 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 805.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 65.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1621 SdHoareTripleChecker+Valid, 41.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1621 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 39.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10327 IncrementalHoareTripleChecker+Invalid, 10567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 28 mSDtfsCounter, 10327 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17798occurred in iteration=15, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown