/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:05:48,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:05:48,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:05:48,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:05:48,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:05:48,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:05:48,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:05:48,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:05:48,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:05:48,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:05:48,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:05:48,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:05:48,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:05:48,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:05:48,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:05:48,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:05:48,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:05:48,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:05:48,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:05:48,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:05:48,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:05:48,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:05:48,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:05:48,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:05:48,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:05:48,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:05:48,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:05:48,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:05:48,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:05:48,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:05:48,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:05:48,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:05:48,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:05:48,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:05:48,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:05:48,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:05:48,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:05:48,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:05:48,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:05:48,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:05:48,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:05:48,478 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:05:48,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:05:48,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:05:48,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:05:48,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:05:48,527 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:05:48,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:05:48,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:05:48,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:05:48,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:05:48,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:05:48,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:05:48,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:05:48,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:05:48,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:05:48,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:05:48,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:05:48,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:05:48,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:05:48,859 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:05:48,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-12-06 04:05:50,047 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:05:50,354 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:05:50,355 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-12-06 04:05:50,371 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2798c67e/719670fada9e47fba99af79e7cf2032c/FLAGd78b1989d [2022-12-06 04:05:50,395 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2798c67e/719670fada9e47fba99af79e7cf2032c [2022-12-06 04:05:50,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:05:50,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:05:50,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:05:50,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:05:50,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:05:50,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:50,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dc7ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50, skipping insertion in model container [2022-12-06 04:05:50,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:50,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:05:50,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:05:50,824 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/stack-2.i[41520,41533] [2022-12-06 04:05:50,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:05:50,867 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:05:50,906 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/stack-2.i[41520,41533] [2022-12-06 04:05:50,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:05:50,981 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:05:50,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50 WrapperNode [2022-12-06 04:05:50,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:05:50,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:05:50,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:05:50,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:05:50,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,041 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2022-12-06 04:05:51,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:05:51,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:05:51,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:05:51,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:05:51,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:05:51,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:05:51,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:05:51,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:05:51,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (1/1) ... [2022-12-06 04:05:51,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:05:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:51,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:05:51,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:05:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 04:05:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 04:05:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 04:05:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 04:05:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:05:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:05:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:05:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:05:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:05:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:05:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:05:51,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:05:51,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:05:51,148 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:05:51,276 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:05:51,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:05:51,536 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:05:51,543 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:05:51,544 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:05:51,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:05:51 BoogieIcfgContainer [2022-12-06 04:05:51,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:05:51,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:05:51,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:05:51,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:05:51,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:05:50" (1/3) ... [2022-12-06 04:05:51,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6b27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:05:51, skipping insertion in model container [2022-12-06 04:05:51,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:05:50" (2/3) ... [2022-12-06 04:05:51,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6b27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:05:51, skipping insertion in model container [2022-12-06 04:05:51,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:05:51" (3/3) ... [2022-12-06 04:05:51,559 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-12-06 04:05:51,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:05:51,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:05:51,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:05:51,652 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:05:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 161 transitions, 338 flow [2022-12-06 04:05:51,762 INFO L130 PetriNetUnfolder]: 10/159 cut-off events. [2022-12-06 04:05:51,762 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:05:51,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 159 events. 10/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 374 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 04:05:51,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 161 transitions, 338 flow [2022-12-06 04:05:51,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 150 transitions, 309 flow [2022-12-06 04:05:51,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:51,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 150 transitions, 309 flow [2022-12-06 04:05:51,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 309 flow [2022-12-06 04:05:51,864 INFO L130 PetriNetUnfolder]: 10/150 cut-off events. [2022-12-06 04:05:51,864 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:05:51,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 150 events. 10/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 305 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 04:05:51,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 150 transitions, 309 flow [2022-12-06 04:05:51,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-06 04:05:56,435 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 04:05:56,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:05:56,453 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;@69d56d56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:05:56,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:05:56,457 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-12-06 04:05:56,457 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:05:56,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:56,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:05:56,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:05:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2031686735, now seen corresponding path program 1 times [2022-12-06 04:05:56,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:56,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120441745] [2022-12-06 04:05:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:56,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120441745] [2022-12-06 04:05:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120441745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:56,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:56,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:05:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660358048] [2022-12-06 04:05:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:56,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:56,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:56,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 04:05:56,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:56,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:56,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 04:05:56,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:57,042 INFO L130 PetriNetUnfolder]: 1057/1759 cut-off events. [2022-12-06 04:05:57,043 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 04:05:57,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3506 conditions, 1759 events. 1057/1759 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8333 event pairs, 288 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 3287. Up to 1020 conditions per place. [2022-12-06 04:05:57,054 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 60 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2022-12-06 04:05:57,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 281 flow [2022-12-06 04:05:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-06 04:05:57,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2022-12-06 04:05:57,067 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 91 flow. Second operand 3 states and 80 transitions. [2022-12-06 04:05:57,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 281 flow [2022-12-06 04:05:57,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 273 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:05:57,073 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2022-12-06 04:05:57,077 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-12-06 04:05:57,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:57,078 INFO L89 Accepts]: Start accepts. Operand has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:57,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:57,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,093 INFO L130 PetriNetUnfolder]: 33/137 cut-off events. [2022-12-06 04:05:57,093 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 04:05:57,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 137 events. 33/137 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 553 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 185. Up to 31 conditions per place. [2022-12-06 04:05:57,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 804 [2022-12-06 04:05:57,130 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:57,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:05:57,132 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 122 flow [2022-12-06 04:05:57,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:57,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:57,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:57,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:05:57,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:05:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1264210042, now seen corresponding path program 1 times [2022-12-06 04:05:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:57,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616676013] [2022-12-06 04:05:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616676013] [2022-12-06 04:05:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616676013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:57,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:05:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793287257] [2022-12-06 04:05:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:57,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:57,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-06 04:05:57,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:57,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:57,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-06 04:05:57,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:57,471 INFO L130 PetriNetUnfolder]: 1155/1941 cut-off events. [2022-12-06 04:05:57,471 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-06 04:05:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4222 conditions, 1941 events. 1155/1941 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9012 event pairs, 505 based on Foata normal form. 52/1517 useless extension candidates. Maximal degree in co-relation 3893. Up to 1497 conditions per place. [2022-12-06 04:05:57,481 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 54 selfloop transitions, 2 changer transitions 5/64 dead transitions. [2022-12-06 04:05:57,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 297 flow [2022-12-06 04:05:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 04:05:57,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2022-12-06 04:05:57,483 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 122 flow. Second operand 3 states and 68 transitions. [2022-12-06 04:05:57,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 297 flow [2022-12-06 04:05:57,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:05:57,486 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 04:05:57,487 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 04:05:57,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:57,487 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:57,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:57,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,497 INFO L130 PetriNetUnfolder]: 31/122 cut-off events. [2022-12-06 04:05:57,497 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-06 04:05:57,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 122 events. 31/122 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 449 event pairs, 2 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 169. Up to 22 conditions per place. [2022-12-06 04:05:57,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-06 04:05:57,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:57,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 04:05:57,511 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 128 flow [2022-12-06 04:05:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:57,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:57,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:57,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:05:57,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:05:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1430422867, now seen corresponding path program 1 times [2022-12-06 04:05:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:57,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085957229] [2022-12-06 04:05:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:57,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085957229] [2022-12-06 04:05:57,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085957229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:57,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:57,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:05:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026999254] [2022-12-06 04:05:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:57,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:57,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-06 04:05:57,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:57,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:57,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-06 04:05:57,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:57,808 INFO L130 PetriNetUnfolder]: 1236/2112 cut-off events. [2022-12-06 04:05:57,808 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-06 04:05:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2112 events. 1236/2112 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10426 event pairs, 828 based on Foata normal form. 54/1720 useless extension candidates. Maximal degree in co-relation 4345. Up to 1726 conditions per place. [2022-12-06 04:05:57,822 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 55 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2022-12-06 04:05:57,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 308 flow [2022-12-06 04:05:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 04:05:57,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2022-12-06 04:05:57,825 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 128 flow. Second operand 3 states and 64 transitions. [2022-12-06 04:05:57,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 308 flow [2022-12-06 04:05:57,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:57,828 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-06 04:05:57,829 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 04:05:57,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:57,829 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:57,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:57,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,845 INFO L130 PetriNetUnfolder]: 46/183 cut-off events. [2022-12-06 04:05:57,845 INFO L131 PetriNetUnfolder]: For 34/42 co-relation queries the response was YES. [2022-12-06 04:05:57,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 183 events. 46/183 cut-off events. For 34/42 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 792 event pairs, 4 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 284. Up to 37 conditions per place. [2022-12-06 04:05:57,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 04:05:57,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:05:57,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 04:05:57,853 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 152 flow [2022-12-06 04:05:57,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:57,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:57,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:05:57,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:05:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1091146717, now seen corresponding path program 1 times [2022-12-06 04:05:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057770020] [2022-12-06 04:05:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057770020] [2022-12-06 04:05:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057770020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:05:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746078598] [2022-12-06 04:05:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:05:57,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 04:05:58,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 04:05:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:58,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 04:05:58,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:05:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:58,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:05:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:58,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746078598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:05:58,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:05:58,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 04:05:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768437274] [2022-12-06 04:05:58,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:05:58,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:05:58,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:05:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:05:58,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-06 04:05:58,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 152 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:58,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:58,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-06 04:05:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:58,853 INFO L130 PetriNetUnfolder]: 2416/4040 cut-off events. [2022-12-06 04:05:58,853 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-06 04:05:58,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9690 conditions, 4040 events. 2416/4040 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 21083 event pairs, 439 based on Foata normal form. 52/3194 useless extension candidates. Maximal degree in co-relation 9101. Up to 1161 conditions per place. [2022-12-06 04:05:58,876 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 176 selfloop transitions, 29 changer transitions 0/208 dead transitions. [2022-12-06 04:05:58,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 208 transitions, 1040 flow [2022-12-06 04:05:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:05:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:05:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2022-12-06 04:05:58,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6051282051282051 [2022-12-06 04:05:58,879 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 152 flow. Second operand 10 states and 236 transitions. [2022-12-06 04:05:58,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 208 transitions, 1040 flow [2022-12-06 04:05:58,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 208 transitions, 1019 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:58,887 INFO L231 Difference]: Finished difference. Result has 56 places, 69 transitions, 382 flow [2022-12-06 04:05:58,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=382, PETRI_PLACES=56, PETRI_TRANSITIONS=69} [2022-12-06 04:05:58,888 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 04:05:58,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:58,889 INFO L89 Accepts]: Start accepts. Operand has 56 places, 69 transitions, 382 flow [2022-12-06 04:05:58,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:58,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:58,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 69 transitions, 382 flow [2022-12-06 04:05:58,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 69 transitions, 382 flow [2022-12-06 04:05:58,915 INFO L130 PetriNetUnfolder]: 108/374 cut-off events. [2022-12-06 04:05:58,916 INFO L131 PetriNetUnfolder]: For 345/412 co-relation queries the response was YES. [2022-12-06 04:05:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 374 events. 108/374 cut-off events. For 345/412 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1946 event pairs, 1 based on Foata normal form. 5/253 useless extension candidates. Maximal degree in co-relation 808. Up to 84 conditions per place. [2022-12-06 04:05:58,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 69 transitions, 382 flow [2022-12-06 04:05:58,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-06 04:05:58,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L969-3-->L946-1: Formula: (= v_~top~0_51 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_51} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_21|, ~top~0=v_~top~0_51, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [604] L1010-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21| |v_~#arr~0.offset_43|) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_27|) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_27| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|) (= |v_t2Thread1of1ForFork1_get_top_#res#1_43| 0) (not (= (mod v_~flag~0_45 256) 0)) (= |v_~#arr~0.base_43| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|) (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_45|) 0) (= |v_t2Thread1of1ForFork1_get_top_#res#1_43| v_~top~0_108)) InVars {~#arr~0.offset=|v_~#arr~0.offset_43|, ~flag~0=v_~flag~0_45, ~top~0=v_~top~0_108, ~#arr~0.base=|v_~#arr~0.base_43|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_43|, t2Thread1of1ForFork1_pop_#t~ret35#1=|v_t2Thread1of1ForFork1_pop_#t~ret35#1_61|, t2Thread1of1ForFork1_get_top_#res#1=|v_t2Thread1of1ForFork1_get_top_#res#1_43|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_21|, ~flag~0=v_~flag~0_45, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_27|, t2Thread1of1ForFork1_pop_#t~nondet36#1=|v_t2Thread1of1ForFork1_pop_#t~nondet36#1_23|, ~top~0=v_~top~0_108, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_45|, t2Thread1of1ForFork1_pop_#t~mem38#1=|v_t2Thread1of1ForFork1_pop_#t~mem38#1_35|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_27|, t2Thread1of1ForFork1_pop_#t~ret37#1=|v_t2Thread1of1ForFork1_pop_#t~ret37#1_41|, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_21|, ~#arr~0.base=|v_~#arr~0.base_43|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem38#1, t2Thread1of1ForFork1_pop_#t~ret35#1, t2Thread1of1ForFork1_get_top_#res#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_pop_#t~ret37#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet36#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1] [2022-12-06 04:05:59,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L969-3-->L946-1: Formula: (= v_~top~0_51 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_51} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_21|, ~top~0=v_~top~0_51, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [607] L950-1-->L948: Formula: (= (+ v_~top~0_119 1) |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_44|) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_44|} OutVars{~top~0=v_~top~0_119} AuxVars[] AssignedVars[~top~0, t2Thread1of1ForFork1_dec_top_#t~post32#1] [2022-12-06 04:05:59,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:05:59,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 04:05:59,056 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 68 transitions, 388 flow [2022-12-06 04:05:59,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:59,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:05:59,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:05:59,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 04:05:59,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:05:59,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:05:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:05:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1886638199, now seen corresponding path program 1 times [2022-12-06 04:05:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:05:59,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527183914] [2022-12-06 04:05:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:05:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:05:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:05:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:05:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:05:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527183914] [2022-12-06 04:05:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527183914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:05:59,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:05:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:05:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343158969] [2022-12-06 04:05:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:05:59,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:05:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:05:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:05:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:05:59,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-06 04:05:59,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 68 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:05:59,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:05:59,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-06 04:05:59,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:05:59,509 INFO L130 PetriNetUnfolder]: 707/1320 cut-off events. [2022-12-06 04:05:59,510 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-12-06 04:05:59,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3332 conditions, 1320 events. 707/1320 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6025 event pairs, 98 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 2706. Up to 1033 conditions per place. [2022-12-06 04:05:59,516 INFO L137 encePairwiseOnDemand]: 36/43 looper letters, 47 selfloop transitions, 6 changer transitions 7/63 dead transitions. [2022-12-06 04:05:59,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 405 flow [2022-12-06 04:05:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:05:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:05:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 04:05:59,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2022-12-06 04:05:59,518 INFO L175 Difference]: Start difference. First operand has 55 places, 68 transitions, 388 flow. Second operand 3 states and 60 transitions. [2022-12-06 04:05:59,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 405 flow [2022-12-06 04:05:59,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 387 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 04:05:59,522 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 214 flow [2022-12-06 04:05:59,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-06 04:05:59,523 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2022-12-06 04:05:59,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:05:59,523 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 214 flow [2022-12-06 04:05:59,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:05:59,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:05:59,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 214 flow [2022-12-06 04:05:59,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 214 flow [2022-12-06 04:05:59,535 INFO L130 PetriNetUnfolder]: 22/142 cut-off events. [2022-12-06 04:05:59,535 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-06 04:05:59,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 142 events. 22/142 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 494 event pairs, 1 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 262. Up to 24 conditions per place. [2022-12-06 04:05:59,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 214 flow [2022-12-06 04:05:59,537 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 04:06:01,198 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 04:06:01,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1676 [2022-12-06 04:06:01,199 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 224 flow [2022-12-06 04:06:01,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:01,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:01,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:01,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:01,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:01,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1297904338, now seen corresponding path program 1 times [2022-12-06 04:06:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:01,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294007417] [2022-12-06 04:06:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:01,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294007417] [2022-12-06 04:06:01,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294007417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513209741] [2022-12-06 04:06:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:01,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:01,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 04:06:01,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:01,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:01,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 04:06:01,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:01,484 INFO L130 PetriNetUnfolder]: 521/985 cut-off events. [2022-12-06 04:06:01,485 INFO L131 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-12-06 04:06:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2727 conditions, 985 events. 521/985 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4504 event pairs, 133 based on Foata normal form. 24/927 useless extension candidates. Maximal degree in co-relation 2213. Up to 480 conditions per place. [2022-12-06 04:06:01,489 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 58 selfloop transitions, 10 changer transitions 5/76 dead transitions. [2022-12-06 04:06:01,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 477 flow [2022-12-06 04:06:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 04:06:01,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2022-12-06 04:06:01,492 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 224 flow. Second operand 5 states and 90 transitions. [2022-12-06 04:06:01,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 477 flow [2022-12-06 04:06:01,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:01,495 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 245 flow [2022-12-06 04:06:01,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-06 04:06:01,498 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2022-12-06 04:06:01,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:01,498 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 245 flow [2022-12-06 04:06:01,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:01,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:01,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 245 flow [2022-12-06 04:06:01,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 245 flow [2022-12-06 04:06:01,510 INFO L130 PetriNetUnfolder]: 29/135 cut-off events. [2022-12-06 04:06:01,510 INFO L131 PetriNetUnfolder]: For 202/202 co-relation queries the response was YES. [2022-12-06 04:06:01,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 135 events. 29/135 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 510 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 296. Up to 21 conditions per place. [2022-12-06 04:06:01,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 245 flow [2022-12-06 04:06:01,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 04:06:01,802 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:06:01,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 04:06:01,803 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 243 flow [2022-12-06 04:06:01,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:01,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:01,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:01,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:01,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1274726441, now seen corresponding path program 1 times [2022-12-06 04:06:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578449400] [2022-12-06 04:06:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:02,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578449400] [2022-12-06 04:06:02,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578449400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:02,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:06:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588817673] [2022-12-06 04:06:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:06:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:06:02,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:06:02,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 04:06:02,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:02,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:02,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 04:06:02,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:02,708 INFO L130 PetriNetUnfolder]: 749/1381 cut-off events. [2022-12-06 04:06:02,709 INFO L131 PetriNetUnfolder]: For 2197/2197 co-relation queries the response was YES. [2022-12-06 04:06:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 1381 events. 749/1381 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6597 event pairs, 118 based on Foata normal form. 20/1288 useless extension candidates. Maximal degree in co-relation 2416. Up to 685 conditions per place. [2022-12-06 04:06:02,715 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 103 selfloop transitions, 18 changer transitions 11/134 dead transitions. [2022-12-06 04:06:02,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 134 transitions, 939 flow [2022-12-06 04:06:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:06:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:06:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-06 04:06:02,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 04:06:02,719 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 243 flow. Second operand 10 states and 150 transitions. [2022-12-06 04:06:02,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 134 transitions, 939 flow [2022-12-06 04:06:02,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 134 transitions, 916 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:02,726 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 467 flow [2022-12-06 04:06:02,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=467, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2022-12-06 04:06:02,727 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 04:06:02,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:02,727 INFO L89 Accepts]: Start accepts. Operand has 60 places, 54 transitions, 467 flow [2022-12-06 04:06:02,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:02,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:02,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 54 transitions, 467 flow [2022-12-06 04:06:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 467 flow [2022-12-06 04:06:02,753 INFO L130 PetriNetUnfolder]: 50/243 cut-off events. [2022-12-06 04:06:02,753 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-06 04:06:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 243 events. 50/243 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1196 event pairs, 1 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 580. Up to 38 conditions per place. [2022-12-06 04:06:02,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 467 flow [2022-12-06 04:06:02,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-06 04:06:02,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L969-3-->L946-1: Formula: (= v_~top~0_51 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_51} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_21|, ~top~0=v_~top~0_51, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [606] L1023-4-->L1024-3: Formula: (and (= (store |v_#memory_int_105| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_105| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre48#1_31|)) |v_#memory_int_104|) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre48#1_31|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_34|, #memory_int=|v_#memory_int_105|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, ULTIMATE.start_main_#t~pre48#1=|v_ULTIMATE.start_main_#t~pre48#1_31|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_25|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_#t~pre46#1=|v_ULTIMATE.start_main_#t~pre46#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre48#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet47#1, #memory_int, ULTIMATE.start_main_#t~pre46#1] [2022-12-06 04:06:02,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:02,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 04:06:02,781 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 473 flow [2022-12-06 04:06:02,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:02,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:02,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:02,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:02,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:02,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 79247705, now seen corresponding path program 2 times [2022-12-06 04:06:02,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:02,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263010309] [2022-12-06 04:06:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263010309] [2022-12-06 04:06:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263010309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:03,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:03,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:06:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512398901] [2022-12-06 04:06:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:03,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:06:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:06:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:06:03,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-06 04:06:03,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 473 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:03,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:03,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-06 04:06:03,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:03,952 INFO L130 PetriNetUnfolder]: 1003/1844 cut-off events. [2022-12-06 04:06:03,952 INFO L131 PetriNetUnfolder]: For 4490/4490 co-relation queries the response was YES. [2022-12-06 04:06:03,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5884 conditions, 1844 events. 1003/1844 cut-off events. For 4490/4490 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9408 event pairs, 161 based on Foata normal form. 26/1870 useless extension candidates. Maximal degree in co-relation 5132. Up to 679 conditions per place. [2022-12-06 04:06:03,965 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 107 selfloop transitions, 33 changer transitions 8/150 dead transitions. [2022-12-06 04:06:03,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 1256 flow [2022-12-06 04:06:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 04:06:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 04:06:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2022-12-06 04:06:03,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2022-12-06 04:06:03,969 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 473 flow. Second operand 12 states and 155 transitions. [2022-12-06 04:06:03,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 1256 flow [2022-12-06 04:06:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1234 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:03,983 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 772 flow [2022-12-06 04:06:03,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=772, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2022-12-06 04:06:03,985 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2022-12-06 04:06:03,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:03,985 INFO L89 Accepts]: Start accepts. Operand has 77 places, 70 transitions, 772 flow [2022-12-06 04:06:03,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:03,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:03,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 70 transitions, 772 flow [2022-12-06 04:06:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 70 transitions, 772 flow [2022-12-06 04:06:04,020 INFO L130 PetriNetUnfolder]: 67/315 cut-off events. [2022-12-06 04:06:04,020 INFO L131 PetriNetUnfolder]: For 1274/1275 co-relation queries the response was YES. [2022-12-06 04:06:04,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 315 events. 67/315 cut-off events. For 1274/1275 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1694 event pairs, 1 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 988. Up to 52 conditions per place. [2022-12-06 04:06:04,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 70 transitions, 772 flow [2022-12-06 04:06:04,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-06 04:06:04,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:04,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 04:06:04,047 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 766 flow [2022-12-06 04:06:04,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:04,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:04,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:04,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:06:04,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1682427585, now seen corresponding path program 3 times [2022-12-06 04:06:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431457483] [2022-12-06 04:06:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:04,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431457483] [2022-12-06 04:06:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431457483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:04,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:04,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:06:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489831007] [2022-12-06 04:06:04,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:04,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:06:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:06:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:06:04,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-06 04:06:04,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 766 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:04,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:04,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-06 04:06:04,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:05,178 INFO L130 PetriNetUnfolder]: 1251/2293 cut-off events. [2022-12-06 04:06:05,178 INFO L131 PetriNetUnfolder]: For 8541/8541 co-relation queries the response was YES. [2022-12-06 04:06:05,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 2293 events. 1251/2293 cut-off events. For 8541/8541 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12185 event pairs, 185 based on Foata normal form. 26/2319 useless extension candidates. Maximal degree in co-relation 7444. Up to 652 conditions per place. [2022-12-06 04:06:05,200 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 104 selfloop transitions, 41 changer transitions 8/155 dead transitions. [2022-12-06 04:06:05,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 155 transitions, 1554 flow [2022-12-06 04:06:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 04:06:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 04:06:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2022-12-06 04:06:05,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39572192513368987 [2022-12-06 04:06:05,202 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 766 flow. Second operand 11 states and 148 transitions. [2022-12-06 04:06:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 155 transitions, 1554 flow [2022-12-06 04:06:05,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1470 flow, removed 42 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:05,225 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 1043 flow [2022-12-06 04:06:05,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1043, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2022-12-06 04:06:05,226 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2022-12-06 04:06:05,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:05,226 INFO L89 Accepts]: Start accepts. Operand has 92 places, 81 transitions, 1043 flow [2022-12-06 04:06:05,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:05,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:05,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 81 transitions, 1043 flow [2022-12-06 04:06:05,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 81 transitions, 1043 flow [2022-12-06 04:06:05,267 INFO L130 PetriNetUnfolder]: 82/382 cut-off events. [2022-12-06 04:06:05,267 INFO L131 PetriNetUnfolder]: For 1890/1891 co-relation queries the response was YES. [2022-12-06 04:06:05,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 382 events. 82/382 cut-off events. For 1890/1891 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2166 event pairs, 1 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1225. Up to 64 conditions per place. [2022-12-06 04:06:05,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 81 transitions, 1043 flow [2022-12-06 04:06:05,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 04:06:05,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:05,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 04:06:05,298 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 1037 flow [2022-12-06 04:06:05,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:05,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:05,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:06:05,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:06:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1997247589, now seen corresponding path program 1 times [2022-12-06 04:06:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566669160] [2022-12-06 04:06:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:06:05,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:06:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:06:05,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:06:05,371 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:06:05,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:06:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 04:06:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:06:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-06 04:06:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 04:06:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:06:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:06:05,374 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:05,379 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:06:05,379 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:06:05,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:06:05 BasicIcfg [2022-12-06 04:06:05,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:06:05,443 INFO L158 Benchmark]: Toolchain (without parser) took 15045.33ms. Allocated memory was 181.4MB in the beginning and 333.4MB in the end (delta: 152.0MB). Free memory was 155.0MB in the beginning and 149.5MB in the end (delta: 5.6MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,444 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:06:05,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.76ms. Allocated memory is still 181.4MB. Free memory was 154.5MB in the beginning and 125.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 181.4MB. Free memory was 125.2MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,444 INFO L158 Benchmark]: Boogie Preprocessor took 42.25ms. Allocated memory is still 181.4MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,444 INFO L158 Benchmark]: RCFGBuilder took 461.16ms. Allocated memory is still 181.4MB. Free memory was 121.0MB in the beginning and 103.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,445 INFO L158 Benchmark]: TraceAbstraction took 13895.35ms. Allocated memory was 181.4MB in the beginning and 333.4MB in the end (delta: 152.0MB). Free memory was 102.6MB in the beginning and 149.5MB in the end (delta: -46.9MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-12-06 04:06:05,446 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.11ms. Allocated memory is still 181.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 582.76ms. Allocated memory is still 181.4MB. Free memory was 154.5MB in the beginning and 125.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 181.4MB. Free memory was 125.2MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.25ms. Allocated memory is still 181.4MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.16ms. Allocated memory is still 181.4MB. Free memory was 121.0MB in the beginning and 103.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13895.35ms. Allocated memory was 181.4MB in the beginning and 333.4MB in the end (delta: 152.0MB). Free memory was 102.6MB in the beginning and 149.5MB in the end (delta: -46.9MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 147 PlacesBefore, 42 PlacesAfterwards, 150 TransitionsBefore, 41 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 83 ConcurrentYvCompositions, 5 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5469, independent: 5388, independent conditional: 5388, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5469, independent: 5388, independent conditional: 0, independent unconditional: 5388, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5469, independent: 5388, independent conditional: 0, independent unconditional: 5388, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5469, independent: 5388, independent conditional: 0, independent unconditional: 5388, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4594, independent: 4536, independent conditional: 0, independent unconditional: 4536, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4594, independent: 4518, independent conditional: 0, independent unconditional: 4518, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5469, independent: 852, independent conditional: 0, independent unconditional: 852, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 4594, unknown conditional: 0, unknown unconditional: 4594] , Statistics on independence cache: Total cache size (in pairs): 8187, Positive cache size: 8129, Positive conditional cache size: 0, Positive unconditional cache size: 8129, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, 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, 41 PlacesBefore, 41 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 804 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 178, independent conditional: 5, independent unconditional: 173, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 178, independent conditional: 1, independent unconditional: 177, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 178, independent conditional: 1, independent unconditional: 177, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 172, independent: 155, independent conditional: 1, independent unconditional: 154, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 172, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 25, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 172, unknown conditional: 5, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 1, Positive unconditional cache size: 154, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, 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.0s, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 25, unknown conditional: 1, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 174, Positive conditional cache size: 1, Positive unconditional cache size: 173, Negative cache size: 23, Negative conditional cache size: 5, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 177, Positive conditional cache size: 1, Positive unconditional cache size: 176, Negative cache size: 24, Negative conditional cache size: 6, Negative unconditional cache size: 18, 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, 56 PlacesBefore, 55 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 318, independent conditional: 318, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 318, independent conditional: 94, independent unconditional: 224, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, independent: 318, independent conditional: 94, independent unconditional: 224, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, independent: 318, independent conditional: 94, independent unconditional: 224, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, independent: 287, independent conditional: 72, independent unconditional: 215, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 35, unknown conditional: 26, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 212, Positive conditional cache size: 23, Positive unconditional cache size: 189, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, 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: 1.7s, 50 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 41 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 114, independent conditional: 114, 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: 114, independent: 114, independent conditional: 15, independent unconditional: 99, 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: 114, independent: 114, independent conditional: 10, independent unconditional: 104, 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: 114, independent: 114, independent conditional: 10, independent unconditional: 104, 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: 37, independent: 37, independent conditional: 10, independent unconditional: 27, 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: 37, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 114, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 37, unknown conditional: 10, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 326, Positive conditional cache size: 37, Positive unconditional cache size: 289, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 48 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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): 366, Positive cache size: 338, Positive conditional cache size: 37, Positive unconditional cache size: 301, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent: 0, independent conditional: 0, 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): 371, Positive cache size: 343, Positive conditional cache size: 42, Positive unconditional cache size: 301, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 76 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 348, Positive conditional cache size: 45, Positive unconditional cache size: 303, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 91 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 353, Positive conditional cache size: 48, Positive unconditional cache size: 305, Negative cache size: 28, Negative conditional cache size: 10, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-2, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=1, arr={3:0}, flag=0, get_top()=0, m={4:0}, stack={3:0}, stack={3:0}, top=0, x=1] [L970] CALL 1 inc_top() [L946] 1 top++ [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=-1, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=1, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 252 locations, 6 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: 13.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1983 IncrementalHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1 mSDtfsCounter, 1983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=9, InterpolantAutomatonStates: 60, 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, 2.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 1 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3/9 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 proved your program to be incorrect! [2022-12-06 04:06:05,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...