/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:31:39,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:31:39,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:31:39,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:31:39,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:31:39,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:31:39,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:31:39,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:31:39,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:31:39,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:31:39,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:31:39,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:31:39,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:31:39,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:31:39,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:31:39,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:31:39,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:31:39,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:31:39,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:31:39,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:31:39,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:31:39,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:31:39,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:31:39,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:31:39,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:31:39,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:31:39,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:31:39,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:31:39,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:31:39,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:31:39,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:31:39,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:31:39,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:31:39,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:31:39,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:31:39,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:31:39,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:31:39,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:31:39,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:31:39,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:31:39,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:31:39,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:31:39,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:31:39,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:31:39,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:31:39,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:31:39,812 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:31:39,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:31:39,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:31:39,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:31:39,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:31:39,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:31:39,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:31:39,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:31:39,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:31:39,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:31:39,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:31:39,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:39,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:31:39,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:31:39,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:31:39,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:31:39,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:31:39,816 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:31:39,816 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-13 00:31:40,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:31:40,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:31:40,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:31:40,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:31:40,134 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:31:40,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-13 00:31:41,186 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:31:41,478 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:31:41,478 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-13 00:31:41,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d095a4730/21cd230da1314f33bc3f203d4e194a08/FLAG5f05a521f [2022-12-13 00:31:41,508 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d095a4730/21cd230da1314f33bc3f203d4e194a08 [2022-12-13 00:31:41,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:31:41,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:31:41,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:41,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:31:41,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:31:41,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:41" (1/1) ... [2022-12-13 00:31:41,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3ce111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:41, skipping insertion in model container [2022-12-13 00:31:41,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:41" (1/1) ... [2022-12-13 00:31:41,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:31:41,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:31:41,929 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_longer-2.i[41529,41542] [2022-12-13 00:31:41,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:41,970 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:31:42,022 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_longer-2.i[41529,41542] [2022-12-13 00:31:42,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:42,108 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:31:42,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42 WrapperNode [2022-12-13 00:31:42,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:42,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:42,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:31:42,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:31:42,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,180 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-13 00:31:42,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:42,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:31:42,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:31:42,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:31:42,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,219 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:31:42,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:31:42,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:31:42,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:31:42,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:42,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:42,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:31:42,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:31:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:31:42,300 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:31:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:31:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:31:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:31:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:31:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:31:42,304 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:31:42,495 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:31:42,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:31:42,696 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:31:42,704 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:31:42,704 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:31:42,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:42 BoogieIcfgContainer [2022-12-13 00:31:42,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:31:42,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:31:42,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:31:42,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:31:42,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:31:41" (1/3) ... [2022-12-13 00:31:42,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ee5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:42, skipping insertion in model container [2022-12-13 00:31:42,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42" (2/3) ... [2022-12-13 00:31:42,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ee5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:42, skipping insertion in model container [2022-12-13 00:31:42,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:42" (3/3) ... [2022-12-13 00:31:42,714 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-13 00:31:42,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:31:42,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:31:42,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:31:42,814 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 00:31:42,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 00:31:42,979 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-13 00:31:42,979 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:31:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 00:31:42,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 00:31:42,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:42,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:43,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:43,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:43,094 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-13 00:31:43,094 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:43,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 00:31:43,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:43,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-13 00:31:48,245 INFO L241 LiptonReduction]: Total number of compositions: 116 [2022-12-13 00:31:48,271 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:31:48,277 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;@5ab82c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:31:48,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:31:48,298 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-13 00:31:48,298 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:48,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:48,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:31:48,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1688471119, now seen corresponding path program 1 times [2022-12-13 00:31:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622435630] [2022-12-13 00:31:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:48,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622435630] [2022-12-13 00:31:48,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622435630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:48,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:48,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396337958] [2022-12-13 00:31:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:48,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:48,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-13 00:31:48,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:48,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:48,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-13 00:31:48,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:50,086 INFO L130 PetriNetUnfolder]: 12108/20257 cut-off events. [2022-12-13 00:31:50,087 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2022-12-13 00:31:50,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39810 conditions, 20257 events. 12108/20257 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 148702 event pairs, 5729 based on Foata normal form. 0/6684 useless extension candidates. Maximal degree in co-relation 39251. Up to 12849 conditions per place. [2022-12-13 00:31:50,169 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 149 selfloop transitions, 8 changer transitions 2/171 dead transitions. [2022-12-13 00:31:50,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 675 flow [2022-12-13 00:31:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-12-13 00:31:50,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 00:31:50,182 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 229 flow. Second operand 3 states and 212 transitions. [2022-12-13 00:31:50,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 675 flow [2022-12-13 00:31:50,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 667 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:31:50,194 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2022-12-13 00:31:50,199 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 00:31:50,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:50,201 INFO L89 Accepts]: Start accepts. Operand has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:50,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:50,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,294 INFO L130 PetriNetUnfolder]: 105/641 cut-off events. [2022-12-13 00:31:50,294 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:31:50,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 641 events. 105/641 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4995 event pairs, 10 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 807. Up to 141 conditions per place. [2022-12-13 00:31:50,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 5408 [2022-12-13 00:31:50,377 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:50,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 00:31:50,380 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:50,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:50,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:50,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:31:50,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash 603354056, now seen corresponding path program 1 times [2022-12-13 00:31:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:50,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219490808] [2022-12-13 00:31:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:50,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219490808] [2022-12-13 00:31:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219490808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239586707] [2022-12-13 00:31:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:50,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:50,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 104 [2022-12-13 00:31:50,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:50,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:50,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 104 [2022-12-13 00:31:50,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:51,894 INFO L130 PetriNetUnfolder]: 11932/20366 cut-off events. [2022-12-13 00:31:51,895 INFO L131 PetriNetUnfolder]: For 342/369 co-relation queries the response was YES. [2022-12-13 00:31:51,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41436 conditions, 20366 events. 11932/20366 cut-off events. For 342/369 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 157941 event pairs, 9139 based on Foata normal form. 13/7209 useless extension candidates. Maximal degree in co-relation 36843. Up to 17512 conditions per place. [2022-12-13 00:31:51,962 INFO L137 encePairwiseOnDemand]: 95/104 looper letters, 131 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2022-12-13 00:31:51,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 156 transitions, 661 flow [2022-12-13 00:31:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-12-13 00:31:51,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-13 00:31:51,965 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 270 flow. Second operand 3 states and 189 transitions. [2022-12-13 00:31:51,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 156 transitions, 661 flow [2022-12-13 00:31:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 156 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:31:51,981 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2022-12-13 00:31:51,982 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 00:31:51,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:51,983 INFO L89 Accepts]: Start accepts. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:51,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:51,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:52,032 INFO L130 PetriNetUnfolder]: 124/726 cut-off events. [2022-12-13 00:31:52,032 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 00:31:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 726 events. 124/726 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5863 event pairs, 15 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 955. Up to 151 conditions per place. [2022-12-13 00:31:52,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:52,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 5928 [2022-12-13 00:31:52,064 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:52,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 00:31:52,066 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:52,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:52,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:52,066 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:31:52,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 85783273, now seen corresponding path program 1 times [2022-12-13 00:31:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553255130] [2022-12-13 00:31:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:52,205 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-13 00:31:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553255130] [2022-12-13 00:31:52,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553255130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429841416] [2022-12-13 00:31:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:52,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:52,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:52,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:31:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 00:31:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:52,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 00:31:52,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:52,396 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-13 00:31:52,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:52,430 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-13 00:31:52,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429841416] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:31:52,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:31:52,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 00:31:52,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589774301] [2022-12-13 00:31:52,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:31:52,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 00:31:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:52,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 00:31:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 00:31:52,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-13 00:31:52,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:52,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:52,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-13 00:31:52,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:55,860 INFO L130 PetriNetUnfolder]: 29463/48122 cut-off events. [2022-12-13 00:31:55,860 INFO L131 PetriNetUnfolder]: For 3749/3749 co-relation queries the response was YES. [2022-12-13 00:31:55,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106727 conditions, 48122 events. 29463/48122 cut-off events. For 3749/3749 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 380788 event pairs, 4471 based on Foata normal form. 372/18353 useless extension candidates. Maximal degree in co-relation 100000. Up to 14903 conditions per place. [2022-12-13 00:31:56,038 INFO L137 encePairwiseOnDemand]: 82/104 looper letters, 494 selfloop transitions, 77 changer transitions 173/756 dead transitions. [2022-12-13 00:31:56,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 756 transitions, 3425 flow [2022-12-13 00:31:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 00:31:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 00:31:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 989 transitions. [2022-12-13 00:31:56,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5005060728744939 [2022-12-13 00:31:56,044 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 309 flow. Second operand 19 states and 989 transitions. [2022-12-13 00:31:56,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 756 transitions, 3425 flow [2022-12-13 00:31:56,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 756 transitions, 3390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:31:56,083 INFO L231 Difference]: Finished difference. Result has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:56,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=951, PETRI_PLACES=138, PETRI_TRANSITIONS=188} [2022-12-13 00:31:56,085 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 27 predicate places. [2022-12-13 00:31:56,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:56,086 INFO L89 Accepts]: Start accepts. Operand has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:56,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:56,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:56,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 188 transitions, 951 flow [2022-12-13 00:31:56,215 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,215 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [154#true, Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,216 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,216 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [114#L996-2true, Black: 228#(= ~top~0 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,217 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,217 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,218 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,218 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,218 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,218 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,219 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,220 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,223 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,229 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,229 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,229 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,230 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 222#true, 23#L1022-4true]) [2022-12-13 00:31:56,230 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,230 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,231 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,231 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,231 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [154#true, Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,232 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,232 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,232 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,233 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,233 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,233 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,234 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,234 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [114#L996-2true, Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 400 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,235 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), 38#L973true, Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,235 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,235 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,238 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 400 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:56,238 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,238 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,238 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,238 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,241 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,242 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,242 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,243 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,243 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,243 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,244 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,244 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,244 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:56,244 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:56,244 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:56,262 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, 123#L945-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,262 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 00:31:56,262 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,263 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 00:31:56,263 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 00:31:56,273 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][51], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 234#true, Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,273 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,273 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,273 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,274 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,274 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,274 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,275 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 23#L1022-4true]) [2022-12-13 00:31:56,275 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,275 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 400 ~top~0)), Black: 325#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (not (<= 400 ~top~0))), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 399), 196#true, 23#L1022-4true]) [2022-12-13 00:31:56,276 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:56,276 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:56,288 INFO L130 PetriNetUnfolder]: 558/2375 cut-off events. [2022-12-13 00:31:56,289 INFO L131 PetriNetUnfolder]: For 2103/2190 co-relation queries the response was YES. [2022-12-13 00:31:56,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2375 events. 558/2375 cut-off events. For 2103/2190 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22936 event pairs, 40 based on Foata normal form. 1/701 useless extension candidates. Maximal degree in co-relation 5506. Up to 596 conditions per place. [2022-12-13 00:31:56,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 188 transitions, 951 flow [2022-12-13 00:31:56,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 8924 [2022-12-13 00:31:56,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] [2022-12-13 00:31:56,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [463] L949-1-->L947: Formula: (= (+ v_~top~0_17 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|} OutVars{~top~0=v_~top~0_17} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 00:31:56,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [609] L973-->L978: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_49| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19| |v_t2Thread1of1ForFork0_pop_~stack#1.base_49|) (= v_~top~0_125 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|, ~top~0=v_~top~0_125, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_49|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|, ~top~0=v_~top~0_125, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_49|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 00:31:56,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [428] L949-1-->L949-2: Formula: (= (+ v_~top~0_11 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|} OutVars{t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|, ~top~0=v_~top~0_11} AuxVars[] AssignedVars[~top~0] [2022-12-13 00:31:56,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [610] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_51| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_35|) 0) (= v_~top~0_127 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21| |v_t2Thread1of1ForFork0_pop_~stack#1.base_51|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|, ~top~0=v_~top~0_127, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_51|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_35|, ~top~0=v_~top~0_127, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_51|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 00:31:56,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [581] L949-1-->L953: Formula: (= (+ v_~top~0_120 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_52|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_52|} OutVars{t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_29|, ~top~0=v_~top~0_120} AuxVars[] AssignedVars[t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 00:31:56,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [547] L973-->L977: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9| |v_t2Thread1of1ForFork0_pop_~stack#1.offset_35|) (= v_~top~0_70 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_35| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9|, ~top~0=v_~top~0_70, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9|, ~top~0=v_~top~0_70, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 00:31:56,861 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:31:56,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-13 00:31:56,862 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 1023 flow [2022-12-13 00:31:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:56,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:56,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:56,874 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-13 00:31:57,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:57,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:31:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2022799586, now seen corresponding path program 1 times [2022-12-13 00:31:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:57,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809069377] [2022-12-13 00:31:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809069377] [2022-12-13 00:31:57,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809069377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:57,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:57,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241478384] [2022-12-13 00:31:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:57,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:31:57,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:31:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:31:57,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 124 [2022-12-13 00:31:57,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 1023 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:57,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:57,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 124 [2022-12-13 00:31:57,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:00,349 INFO L130 PetriNetUnfolder]: 26034/43850 cut-off events. [2022-12-13 00:32:00,349 INFO L131 PetriNetUnfolder]: For 28225/30020 co-relation queries the response was YES. [2022-12-13 00:32:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111083 conditions, 43850 events. 26034/43850 cut-off events. For 28225/30020 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 369578 event pairs, 20881 based on Foata normal form. 244/17443 useless extension candidates. Maximal degree in co-relation 104084. Up to 40583 conditions per place. [2022-12-13 00:32:00,572 INFO L137 encePairwiseOnDemand]: 119/124 looper letters, 147 selfloop transitions, 0 changer transitions 0/181 dead transitions. [2022-12-13 00:32:00,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 181 transitions, 1242 flow [2022-12-13 00:32:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:32:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:32:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-12-13 00:32:00,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2022-12-13 00:32:00,574 INFO L175 Difference]: Start difference. First operand has 135 places, 186 transitions, 1023 flow. Second operand 2 states and 142 transitions. [2022-12-13 00:32:00,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 181 transitions, 1242 flow [2022-12-13 00:32:01,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 181 transitions, 1138 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-13 00:32:01,010 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 844 flow [2022-12-13 00:32:01,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=844, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2022-12-13 00:32:01,011 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2022-12-13 00:32:01,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:01,012 INFO L89 Accepts]: Start accepts. Operand has 132 places, 181 transitions, 844 flow [2022-12-13 00:32:01,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:01,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:01,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 181 transitions, 844 flow [2022-12-13 00:32:01,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 181 transitions, 844 flow [2022-12-13 00:32:01,232 INFO L130 PetriNetUnfolder]: 483/2294 cut-off events. [2022-12-13 00:32:01,232 INFO L131 PetriNetUnfolder]: For 1527/1601 co-relation queries the response was YES. [2022-12-13 00:32:01,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2294 events. 483/2294 cut-off events. For 1527/1601 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23058 event pairs, 40 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4610. Up to 529 conditions per place. [2022-12-13 00:32:01,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 181 transitions, 844 flow [2022-12-13 00:32:01,257 INFO L226 LiptonReduction]: Number of co-enabled transitions 8574 [2022-12-13 00:32:01,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [670] L945-->pop_returnLabel#1: Formula: (and (= v_~top~0_434 0) (= v_~top~0_434 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_271|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_85|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_104| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_104| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|, ~top~0=v_~top~0_434, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_104|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_39|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_85|, ~top~0=v_~top~0_434, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_104|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_271|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 00:32:01,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [674] L945-->L977: Formula: (and (= v_~top~0_448 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_106| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|) (= v_~top~0_448 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_281|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_106| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|, ~top~0=v_~top~0_448, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_106|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|, ~top~0=v_~top~0_448, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_106|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_281|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 00:32:01,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [667] L945-->L978: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_102| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|) (= v_~top~0_424 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_263|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_102| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|) (= v_~top~0_424 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|, ~top~0=v_~top~0_424, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_102|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_37|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|, ~top~0=v_~top~0_424, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_102|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_263|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 00:32:01,305 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:32:01,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 00:32:01,307 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 181 transitions, 856 flow [2022-12-13 00:32:01,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:01,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:01,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:32:01,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash -979973897, now seen corresponding path program 1 times [2022-12-13 00:32:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:01,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307610990] [2022-12-13 00:32:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:01,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:01,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307610990] [2022-12-13 00:32:01,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307610990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:01,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:01,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:32:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061461002] [2022-12-13 00:32:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:01,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:32:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:32:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:32:01,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 119 [2022-12-13 00:32:01,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 181 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:01,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:01,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 119 [2022-12-13 00:32:01,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:02,354 INFO L130 PetriNetUnfolder]: 8437/15041 cut-off events. [2022-12-13 00:32:02,354 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2022-12-13 00:32:02,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34267 conditions, 15041 events. 8437/15041 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 116869 event pairs, 1188 based on Foata normal form. 0/6267 useless extension candidates. Maximal degree in co-relation 30302. Up to 11555 conditions per place. [2022-12-13 00:32:02,393 INFO L137 encePairwiseOnDemand]: 97/119 looper letters, 62 selfloop transitions, 12 changer transitions 59/159 dead transitions. [2022-12-13 00:32:02,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 159 transitions, 879 flow [2022-12-13 00:32:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:32:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:32:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-12-13 00:32:02,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 00:32:02,395 INFO L175 Difference]: Start difference. First operand has 131 places, 181 transitions, 856 flow. Second operand 3 states and 182 transitions. [2022-12-13 00:32:02,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 159 transitions, 879 flow [2022-12-13 00:32:02,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 159 transitions, 854 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-13 00:32:02,455 INFO L231 Difference]: Finished difference. Result has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:02,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=120, PETRI_TRANSITIONS=80} [2022-12-13 00:32:02,456 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2022-12-13 00:32:02,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:02,456 INFO L89 Accepts]: Start accepts. Operand has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:02,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:02,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:02,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:02,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 325 flow [2022-12-13 00:32:02,478 INFO L130 PetriNetUnfolder]: 59/422 cut-off events. [2022-12-13 00:32:02,478 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 00:32:02,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 422 events. 59/422 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2828 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 746. Up to 50 conditions per place. [2022-12-13 00:32:02,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 325 flow [2022-12-13 00:32:02,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 1810 [2022-12-13 00:32:04,239 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 00:32:04,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1784 [2022-12-13 00:32:04,240 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 367 flow [2022-12-13 00:32:04,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:04,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:04,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:32:04,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1381920925, now seen corresponding path program 1 times [2022-12-13 00:32:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:04,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623479543] [2022-12-13 00:32:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623479543] [2022-12-13 00:32:04,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623479543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:04,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:04,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:32:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241604273] [2022-12-13 00:32:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:32:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:32:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:32:04,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-13 00:32:04,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:04,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:04,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-13 00:32:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:05,921 INFO L130 PetriNetUnfolder]: 6658/11972 cut-off events. [2022-12-13 00:32:05,922 INFO L131 PetriNetUnfolder]: For 6671/6680 co-relation queries the response was YES. [2022-12-13 00:32:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31809 conditions, 11972 events. 6658/11972 cut-off events. For 6671/6680 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 89824 event pairs, 1620 based on Foata normal form. 46/6632 useless extension candidates. Maximal degree in co-relation 22064. Up to 4823 conditions per place. [2022-12-13 00:32:05,966 INFO L137 encePairwiseOnDemand]: 52/67 looper letters, 160 selfloop transitions, 14 changer transitions 29/215 dead transitions. [2022-12-13 00:32:05,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 215 transitions, 1422 flow [2022-12-13 00:32:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:32:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:32:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2022-12-13 00:32:05,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.582089552238806 [2022-12-13 00:32:05,968 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 367 flow. Second operand 7 states and 273 transitions. [2022-12-13 00:32:05,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 215 transitions, 1422 flow [2022-12-13 00:32:05,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 215 transitions, 1328 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:32:05,990 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:05,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2022-12-13 00:32:05,993 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -33 predicate places. [2022-12-13 00:32:05,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:05,993 INFO L89 Accepts]: Start accepts. Operand has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:05,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:05,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:05,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:05,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 439 flow [2022-12-13 00:32:06,056 INFO L130 PetriNetUnfolder]: 148/771 cut-off events. [2022-12-13 00:32:06,057 INFO L131 PetriNetUnfolder]: For 1148/1152 co-relation queries the response was YES. [2022-12-13 00:32:06,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 771 events. 148/771 cut-off events. For 1148/1152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6261 event pairs, 0 based on Foata normal form. 4/474 useless extension candidates. Maximal degree in co-relation 1281. Up to 150 conditions per place. [2022-12-13 00:32:06,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 439 flow [2022-12-13 00:32:06,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 1706 [2022-12-13 00:32:07,278 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:32:07,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1286 [2022-12-13 00:32:07,279 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 441 flow [2022-12-13 00:32:07,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:07,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:07,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:07,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:32:07,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 60048697, now seen corresponding path program 1 times [2022-12-13 00:32:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:07,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959517584] [2022-12-13 00:32:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:07,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959517584] [2022-12-13 00:32:07,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959517584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:07,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:07,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389041422] [2022-12-13 00:32:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:07,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2022-12-13 00:32:07,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:07,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:07,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2022-12-13 00:32:07,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:08,727 INFO L130 PetriNetUnfolder]: 7027/12731 cut-off events. [2022-12-13 00:32:08,728 INFO L131 PetriNetUnfolder]: For 14070/14070 co-relation queries the response was YES. [2022-12-13 00:32:08,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33284 conditions, 12731 events. 7027/12731 cut-off events. For 14070/14070 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 97747 event pairs, 1174 based on Foata normal form. 138/7503 useless extension candidates. Maximal degree in co-relation 25490. Up to 4272 conditions per place. [2022-12-13 00:32:08,762 INFO L137 encePairwiseOnDemand]: 49/63 looper letters, 130 selfloop transitions, 14 changer transitions 21/177 dead transitions. [2022-12-13 00:32:08,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 177 transitions, 1178 flow [2022-12-13 00:32:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:32:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:32:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2022-12-13 00:32:08,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-13 00:32:08,764 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 441 flow. Second operand 6 states and 225 transitions. [2022-12-13 00:32:08,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 177 transitions, 1178 flow [2022-12-13 00:32:08,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 177 transitions, 1114 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-13 00:32:08,793 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2022-12-13 00:32:08,794 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -36 predicate places. [2022-12-13 00:32:08,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:08,794 INFO L89 Accepts]: Start accepts. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:08,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:08,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,849 INFO L130 PetriNetUnfolder]: 148/859 cut-off events. [2022-12-13 00:32:08,849 INFO L131 PetriNetUnfolder]: For 1302/1313 co-relation queries the response was YES. [2022-12-13 00:32:08,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 859 events. 148/859 cut-off events. For 1302/1313 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7583 event pairs, 3 based on Foata normal form. 5/481 useless extension candidates. Maximal degree in co-relation 1365. Up to 174 conditions per place. [2022-12-13 00:32:08,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-13 00:32:08,855 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:08,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 00:32:08,856 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:08,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:08,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:32:08,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 641784670, now seen corresponding path program 1 times [2022-12-13 00:32:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:08,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477565984] [2022-12-13 00:32:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:32:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477565984] [2022-12-13 00:32:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477565984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120847715] [2022-12-13 00:32:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:08,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:08,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:08,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 00:32:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:09,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 00:32:09,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:09,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:32:09,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120847715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:09,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:32:09,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-13 00:32:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775584989] [2022-12-13 00:32:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:09,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:32:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:32:09,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:32:09,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-13 00:32:09,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:09,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:09,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-13 00:32:09,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:09,742 INFO L130 PetriNetUnfolder]: 7383/13277 cut-off events. [2022-12-13 00:32:09,742 INFO L131 PetriNetUnfolder]: For 14382/14382 co-relation queries the response was YES. [2022-12-13 00:32:09,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34973 conditions, 13277 events. 7383/13277 cut-off events. For 14382/14382 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 103031 event pairs, 2623 based on Foata normal form. 123/7861 useless extension candidates. Maximal degree in co-relation 26553. Up to 4872 conditions per place. [2022-12-13 00:32:09,788 INFO L137 encePairwiseOnDemand]: 45/60 looper letters, 102 selfloop transitions, 13 changer transitions 4/128 dead transitions. [2022-12-13 00:32:09,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 128 transitions, 871 flow [2022-12-13 00:32:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:32:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:32:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-12-13 00:32:09,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 00:32:09,789 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 455 flow. Second operand 4 states and 141 transitions. [2022-12-13 00:32:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 128 transitions, 871 flow [2022-12-13 00:32:09,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 855 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 00:32:09,825 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:09,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2022-12-13 00:32:09,826 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -32 predicate places. [2022-12-13 00:32:09,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:09,826 INFO L89 Accepts]: Start accepts. Operand has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:09,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:09,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:09,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:09,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:09,873 INFO L130 PetriNetUnfolder]: 129/880 cut-off events. [2022-12-13 00:32:09,873 INFO L131 PetriNetUnfolder]: For 1821/1831 co-relation queries the response was YES. [2022-12-13 00:32:09,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 880 events. 129/880 cut-off events. For 1821/1831 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8104 event pairs, 3 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1575. Up to 174 conditions per place. [2022-12-13 00:32:09,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:09,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 00:32:09,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:09,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 00:32:09,882 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:09,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:09,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:09,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:09,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 00:32:10,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 00:32:10,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1582603438, now seen corresponding path program 1 times [2022-12-13 00:32:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:10,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106932130] [2022-12-13 00:32:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:10,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106932130] [2022-12-13 00:32:10,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106932130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:10,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:10,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728604960] [2022-12-13 00:32:10,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:10,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:10,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:10,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:10,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:32:10,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:10,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:10,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:32:10,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:11,950 INFO L130 PetriNetUnfolder]: 10465/19171 cut-off events. [2022-12-13 00:32:11,950 INFO L131 PetriNetUnfolder]: For 25653/25653 co-relation queries the response was YES. [2022-12-13 00:32:12,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51540 conditions, 19171 events. 10465/19171 cut-off events. For 25653/25653 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 159002 event pairs, 3206 based on Foata normal form. 46/11215 useless extension candidates. Maximal degree in co-relation 42911. Up to 5131 conditions per place. [2022-12-13 00:32:12,067 INFO L137 encePairwiseOnDemand]: 42/58 looper letters, 179 selfloop transitions, 43 changer transitions 3/234 dead transitions. [2022-12-13 00:32:12,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 1667 flow [2022-12-13 00:32:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 00:32:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 00:32:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-12-13 00:32:12,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.506896551724138 [2022-12-13 00:32:12,070 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 486 flow. Second operand 10 states and 294 transitions. [2022-12-13 00:32:12,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 1667 flow [2022-12-13 00:32:12,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 234 transitions, 1636 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:32:12,166 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=842, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2022-12-13 00:32:12,167 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -24 predicate places. [2022-12-13 00:32:12,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:12,168 INFO L89 Accepts]: Start accepts. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:12,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:12,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,262 INFO L130 PetriNetUnfolder]: 187/1319 cut-off events. [2022-12-13 00:32:12,262 INFO L131 PetriNetUnfolder]: For 3036/3040 co-relation queries the response was YES. [2022-12-13 00:32:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 1319 events. 187/1319 cut-off events. For 3036/3040 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13039 event pairs, 0 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 2537. Up to 254 conditions per place. [2022-12-13 00:32:12,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 2084 [2022-12-13 00:32:12,275 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:12,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 00:32:12,276 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:12,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:12,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:32:12,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:32:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash -511069260, now seen corresponding path program 2 times [2022-12-13 00:32:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:12,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779998890] [2022-12-13 00:32:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:12,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779998890] [2022-12-13 00:32:12,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779998890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:12,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603048823] [2022-12-13 00:32:12,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:32:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:12,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:32:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 00:32:12,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 00:32:12,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:32:12,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 00:32:12,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:13,011 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 00:32:13,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 00:32:13,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 00:32:13,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-13 00:32:13,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 00:32:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:16,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:16,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:32:16,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 00:32:16,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-13 00:32:16,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 00:32:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 00:32:16,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603048823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:16,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:32:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220585343] [2022-12-13 00:32:16,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:16,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:32:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:32:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=217, Unknown=4, NotChecked=0, Total=272 [2022-12-13 00:32:16,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:32:16,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 842 flow. Second operand has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:32:16,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:16,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:32:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:19,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:21,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:23,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:25,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:27,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:29,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:31,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:33,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:35,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:38,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:40,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:42,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:44,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:46,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:48,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:50,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:52,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:54,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:56,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:58,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:00,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:02,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:03,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:06,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:08,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:09,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:11,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:12,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:14,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:16,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:18,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:22,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:24,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:26,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:28,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:30,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:32,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:37,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:41,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:43,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:45,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:47,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:49,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:52,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:08,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:11,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:13,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:15,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:19,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:24,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:27,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:29,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:31,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:33,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:36,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:38,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:40,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:42,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:44,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:45,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:47,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:49,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:51,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:53,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:56,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:58,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:59,448 INFO L130 PetriNetUnfolder]: 21100/38466 cut-off events. [2022-12-13 00:34:59,448 INFO L131 PetriNetUnfolder]: For 62303/62303 co-relation queries the response was YES. [2022-12-13 00:34:59,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106003 conditions, 38466 events. 21100/38466 cut-off events. For 62303/62303 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 329107 event pairs, 3969 based on Foata normal form. 23/22320 useless extension candidates. Maximal degree in co-relation 78843. Up to 7889 conditions per place. [2022-12-13 00:34:59,588 INFO L137 encePairwiseOnDemand]: 42/58 looper letters, 242 selfloop transitions, 93 changer transitions 15/359 dead transitions. [2022-12-13 00:34:59,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 359 transitions, 2924 flow [2022-12-13 00:34:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 00:34:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 00:34:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 406 transitions. [2022-12-13 00:34:59,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 00:34:59,590 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 842 flow. Second operand 14 states and 406 transitions. [2022-12-13 00:34:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 359 transitions, 2924 flow [2022-12-13 00:34:59,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 359 transitions, 2818 flow, removed 48 selfloop flow, removed 3 redundant places. [2022-12-13 00:34:59,719 INFO L231 Difference]: Finished difference. Result has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1657, PETRI_PLACES=99, PETRI_TRANSITIONS=154} [2022-12-13 00:34:59,720 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -12 predicate places. [2022-12-13 00:34:59,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:34:59,720 INFO L89 Accepts]: Start accepts. Operand has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:34:59,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:59,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,969 INFO L130 PetriNetUnfolder]: 372/2488 cut-off events. [2022-12-13 00:34:59,969 INFO L131 PetriNetUnfolder]: For 7554/7560 co-relation queries the response was YES. [2022-12-13 00:34:59,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2488 events. 372/2488 cut-off events. For 7554/7560 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 25322 event pairs, 0 based on Foata normal form. 2/1413 useless extension candidates. Maximal degree in co-relation 5155. Up to 506 conditions per place. [2022-12-13 00:34:59,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 3152 [2022-12-13 00:34:59,993 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:34:59,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-13 00:34:59,994 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 154 transitions, 1657 flow [2022-12-13 00:34:59,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:34:59,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:34:59,994 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:34:59,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 00:35:00,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:00,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:35:00,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -971263192, now seen corresponding path program 1 times [2022-12-13 00:35:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:00,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737052340] [2022-12-13 00:35:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737052340] [2022-12-13 00:35:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737052340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:35:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687022881] [2022-12-13 00:35:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:35:00,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:35:00,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 00:35:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:00,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 00:35:00,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:35:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:00,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:35:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687022881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:35:00,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:35:00,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 00:35:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637036786] [2022-12-13 00:35:00,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:35:00,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 00:35:00,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 00:35:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-13 00:35:00,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:35:00,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 154 transitions, 1657 flow. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:00,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:00,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:35:00,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:05,185 INFO L130 PetriNetUnfolder]: 30814/55662 cut-off events. [2022-12-13 00:35:05,185 INFO L131 PetriNetUnfolder]: For 108642/108642 co-relation queries the response was YES. [2022-12-13 00:35:05,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157742 conditions, 55662 events. 30814/55662 cut-off events. For 108642/108642 co-relation queries the response was YES. Maximal size of possible extension queue 1506. Compared 498558 event pairs, 5526 based on Foata normal form. 549/33001 useless extension candidates. Maximal degree in co-relation 126892. Up to 10797 conditions per place. [2022-12-13 00:35:05,427 INFO L137 encePairwiseOnDemand]: 40/58 looper letters, 354 selfloop transitions, 130 changer transitions 16/509 dead transitions. [2022-12-13 00:35:05,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 509 transitions, 4689 flow [2022-12-13 00:35:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:35:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:35:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 507 transitions. [2022-12-13 00:35:05,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48563218390804597 [2022-12-13 00:35:05,429 INFO L175 Difference]: Start difference. First operand has 99 places, 154 transitions, 1657 flow. Second operand 18 states and 507 transitions. [2022-12-13 00:35:05,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 509 transitions, 4689 flow [2022-12-13 00:35:05,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 509 transitions, 4485 flow, removed 100 selfloop flow, removed 2 redundant places. [2022-12-13 00:35:05,778 INFO L231 Difference]: Finished difference. Result has 122 places, 221 transitions, 3001 flow [2022-12-13 00:35:05,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3001, PETRI_PLACES=122, PETRI_TRANSITIONS=221} [2022-12-13 00:35:05,779 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-13 00:35:05,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:05,779 INFO L89 Accepts]: Start accepts. Operand has 122 places, 221 transitions, 3001 flow [2022-12-13 00:35:05,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:05,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:05,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 221 transitions, 3001 flow [2022-12-13 00:35:05,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 221 transitions, 3001 flow [2022-12-13 00:35:06,011 INFO L130 PetriNetUnfolder]: 556/3481 cut-off events. [2022-12-13 00:35:06,011 INFO L131 PetriNetUnfolder]: For 17054/17065 co-relation queries the response was YES. [2022-12-13 00:35:06,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10020 conditions, 3481 events. 556/3481 cut-off events. For 17054/17065 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 38134 event pairs, 0 based on Foata normal form. 2/2074 useless extension candidates. Maximal degree in co-relation 9470. Up to 730 conditions per place. [2022-12-13 00:35:06,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 221 transitions, 3001 flow [2022-12-13 00:35:06,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 4564 [2022-12-13 00:35:06,533 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:35:06,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 755 [2022-12-13 00:35:06,534 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 216 transitions, 2985 flow [2022-12-13 00:35:06,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:06,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:06,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:06,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 00:35:06,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:06,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:35:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1481343952, now seen corresponding path program 1 times [2022-12-13 00:35:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:06,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221353467] [2022-12-13 00:35:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221353467] [2022-12-13 00:35:07,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221353467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:35:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962171292] [2022-12-13 00:35:07,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:07,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:35:07,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:35:07,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 00:35:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:07,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 00:35:07,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:35:07,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 00:35:07,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 00:35:07,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-12-13 00:35:08,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 00:35:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:11,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:35:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:12,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962171292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:35:12,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:35:12,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-12-13 00:35:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140374620] [2022-12-13 00:35:12,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:35:12,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 00:35:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 00:35:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=156, Unknown=1, NotChecked=0, Total=210 [2022-12-13 00:35:12,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 77 [2022-12-13 00:35:12,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 216 transitions, 2985 flow. Second operand has 15 states, 15 states have (on average 12.2) internal successors, (183), 15 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:12,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:12,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 77 [2022-12-13 00:35:12,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:14,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:17,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:19,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:23,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:25,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:27,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:29,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:32,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:34,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:36,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:38,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:40,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:42,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:46,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:48,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:51,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:35:58,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:01,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:03,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:06,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:08,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:13,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:15,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:18,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:20,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:22,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:24,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:26,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:28,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:30,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:32,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:38,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:40,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:42,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:44,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:46,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:48,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:50,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:53,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:55,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:57,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:36:59,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:04,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:08,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:10,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:12,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:14,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:19,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:21,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:24,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:26,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:28,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:34,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:36,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:40,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:42,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:46,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:49,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:37:55,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:01,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:05,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:10,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:13,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:16,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:38:22,544 INFO L130 PetriNetUnfolder]: 55357/101193 cut-off events. [2022-12-13 00:38:22,544 INFO L131 PetriNetUnfolder]: For 249529/249529 co-relation queries the response was YES. [2022-12-13 00:38:23,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296813 conditions, 101193 events. 55357/101193 cut-off events. For 249529/249529 co-relation queries the response was YES. Maximal size of possible extension queue 2745. Compared 986201 event pairs, 15638 based on Foata normal form. 115/59339 useless extension candidates. Maximal degree in co-relation 283352. Up to 36017 conditions per place. [2022-12-13 00:38:23,350 INFO L137 encePairwiseOnDemand]: 53/77 looper letters, 646 selfloop transitions, 182 changer transitions 36/873 dead transitions. [2022-12-13 00:38:23,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 873 transitions, 9675 flow [2022-12-13 00:38:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 00:38:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 00:38:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 876 transitions. [2022-12-13 00:38:23,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37922077922077924 [2022-12-13 00:38:23,372 INFO L175 Difference]: Start difference. First operand has 117 places, 216 transitions, 2985 flow. Second operand 30 states and 876 transitions. [2022-12-13 00:38:23,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 873 transitions, 9675 flow [2022-12-13 00:38:24,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 873 transitions, 9073 flow, removed 301 selfloop flow, removed 0 redundant places. [2022-12-13 00:38:24,987 INFO L231 Difference]: Finished difference. Result has 164 places, 346 transitions, 5460 flow [2022-12-13 00:38:24,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5460, PETRI_PLACES=164, PETRI_TRANSITIONS=346} [2022-12-13 00:38:24,988 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 53 predicate places. [2022-12-13 00:38:24,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:24,988 INFO L89 Accepts]: Start accepts. Operand has 164 places, 346 transitions, 5460 flow [2022-12-13 00:38:24,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:24,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:24,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 346 transitions, 5460 flow [2022-12-13 00:38:24,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 346 transitions, 5460 flow [2022-12-13 00:38:25,618 INFO L130 PetriNetUnfolder]: 972/6471 cut-off events. [2022-12-13 00:38:25,618 INFO L131 PetriNetUnfolder]: For 33558/33563 co-relation queries the response was YES. [2022-12-13 00:38:25,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18523 conditions, 6471 events. 972/6471 cut-off events. For 33558/33563 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 80190 event pairs, 0 based on Foata normal form. 2/3804 useless extension candidates. Maximal degree in co-relation 17803. Up to 1314 conditions per place. [2022-12-13 00:38:25,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 346 transitions, 5460 flow [2022-12-13 00:38:25,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 7030 [2022-12-13 00:38:27,366 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:38:27,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2379 [2022-12-13 00:38:27,367 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 344 transitions, 5477 flow [2022-12-13 00:38:27,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.2) internal successors, (183), 15 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:27,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:27,368 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:27,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 00:38:27,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 00:38:27,569 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1589090985, now seen corresponding path program 1 times [2022-12-13 00:38:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:27,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860013665] [2022-12-13 00:38:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 00:38:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:27,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860013665] [2022-12-13 00:38:27,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860013665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:27,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:27,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563444507] [2022-12-13 00:38:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:27,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:38:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:38:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:38:27,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 86 [2022-12-13 00:38:27,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 344 transitions, 5477 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:27,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:27,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 86 [2022-12-13 00:38:27,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:46,267 INFO L130 PetriNetUnfolder]: 72902/133369 cut-off events. [2022-12-13 00:38:46,267 INFO L131 PetriNetUnfolder]: For 379965/379965 co-relation queries the response was YES. [2022-12-13 00:38:47,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396376 conditions, 133369 events. 72902/133369 cut-off events. For 379965/379965 co-relation queries the response was YES. Maximal size of possible extension queue 3565. Compared 1369572 event pairs, 44399 based on Foata normal form. 69/78033 useless extension candidates. Maximal degree in co-relation 379142. Up to 70735 conditions per place. [2022-12-13 00:38:47,394 INFO L137 encePairwiseOnDemand]: 59/86 looper letters, 447 selfloop transitions, 116 changer transitions 2/574 dead transitions. [2022-12-13 00:38:47,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 574 transitions, 9002 flow [2022-12-13 00:38:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:38:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:38:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 300 transitions. [2022-12-13 00:38:47,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875968992248062 [2022-12-13 00:38:47,396 INFO L175 Difference]: Start difference. First operand has 162 places, 344 transitions, 5477 flow. Second operand 9 states and 300 transitions. [2022-12-13 00:38:47,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 574 transitions, 9002 flow [2022-12-13 00:38:51,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 574 transitions, 8821 flow, removed 84 selfloop flow, removed 4 redundant places. [2022-12-13 00:38:51,508 INFO L231 Difference]: Finished difference. Result has 169 places, 393 transitions, 6650 flow [2022-12-13 00:38:51,509 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=5340, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6650, PETRI_PLACES=169, PETRI_TRANSITIONS=393} [2022-12-13 00:38:51,509 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 58 predicate places. [2022-12-13 00:38:51,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:51,509 INFO L89 Accepts]: Start accepts. Operand has 169 places, 393 transitions, 6650 flow [2022-12-13 00:38:51,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:51,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:51,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 393 transitions, 6650 flow [2022-12-13 00:38:51,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 393 transitions, 6650 flow [2022-12-13 00:38:52,390 INFO L130 PetriNetUnfolder]: 1271/8480 cut-off events. [2022-12-13 00:38:52,391 INFO L131 PetriNetUnfolder]: For 45936/45944 co-relation queries the response was YES. [2022-12-13 00:38:52,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24452 conditions, 8480 events. 1271/8480 cut-off events. For 45936/45944 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 110694 event pairs, 0 based on Foata normal form. 2/4960 useless extension candidates. Maximal degree in co-relation 24259. Up to 1706 conditions per place. [2022-12-13 00:38:52,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 393 transitions, 6650 flow [2022-12-13 00:38:52,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 7950 [2022-12-13 00:38:52,736 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:38:52,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1228 [2022-12-13 00:38:52,737 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 391 transitions, 6638 flow [2022-12-13 00:38:52,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:52,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:52,738 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:52,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:38:52,738 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:38:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1380703911, now seen corresponding path program 2 times [2022-12-13 00:38:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856331836] [2022-12-13 00:38:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 00:38:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:53,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856331836] [2022-12-13 00:38:53,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856331836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:38:53,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645507598] [2022-12-13 00:38:53,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:38:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:38:53,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:38:53,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:38:53,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 00:38:53,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 00:38:53,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:38:53,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 00:38:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:38:53,309 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:38:53,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 00:38:53,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 00:38:53,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-12-13 00:38:53,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 00:38:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 00:38:56,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:38:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645507598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:56,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:38:56,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2022-12-13 00:38:56,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986208920] [2022-12-13 00:38:56,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:56,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:38:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:56,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:38:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 00:38:56,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 87 [2022-12-13 00:38:56,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 391 transitions, 6638 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:56,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:56,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 87 [2022-12-13 00:38:56,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:58,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:01,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:04,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:06,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:08,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:10,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:12,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:13,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:15,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:17,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:20,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:21,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:23,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:26,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:28,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:30,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:32,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:34,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:35,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:38,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:41,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:42,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:44,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:46,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:47,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:50,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:52,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:54,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:55,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:57,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:39:59,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:40:03,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:40:16,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]