/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_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:31:41,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:31:41,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:31:41,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:31:41,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:31:41,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:31:41,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:31:41,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:31:41,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:31:41,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:31:41,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:31:41,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:31:41,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:31:41,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:31:41,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:31:41,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:31:41,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:31:41,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:31:41,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:31:41,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:31:41,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:31:41,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:31:41,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:31:41,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:31:41,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:31:41,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:31:41,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:31:41,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:31:41,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:31:41,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:31:41,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:31:41,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:31:41,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:31:41,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:31:41,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:31:41,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:31:41,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:31:41,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:31:41,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:31:41,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:31:41,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:31:41,166 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:41,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:31:41,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:31:41,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:31:41,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:31:41,204 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:31:41,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:31:41,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:31:41,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:31:41,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:31:41,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:31:41,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:31:41,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:41,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:31:41,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:31:41,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:31:41,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:31:41,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:31:41,208 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:41,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:31:41,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:31:41,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:31:41,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:31:41,508 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:31:41,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-13 00:31:42,522 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:31:42,746 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:31:42,747 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-13 00:31:42,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fd8fbcc/69fbb84cd71741ab9430d21dd06dd03a/FLAGe9108cc93 [2022-12-13 00:31:42,780 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6fd8fbcc/69fbb84cd71741ab9430d21dd06dd03a [2022-12-13 00:31:42,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:31:42,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:31:42,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:42,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:31:42,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:31:42,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8d2fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:42, skipping insertion in model container [2022-12-13 00:31:42,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:31:42" (1/1) ... [2022-12-13 00:31:42,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:31:42,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:31:43,113 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_longest-2.i[41530,41543] [2022-12-13 00:31:43,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:43,147 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:31:43,176 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_longest-2.i[41530,41543] [2022-12-13 00:31:43,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:31:43,235 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:31:43,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:43 WrapperNode [2022-12-13 00:31:43,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:31:43,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:43,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:31:43,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:31:43,243 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:43" (1/1) ... [2022-12-13 00:31:43,270 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:43" (1/1) ... [2022-12-13 00:31:43,296 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-13 00:31:43,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:31:43,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:31:43,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:31:43,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:31:43,303 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:43" (1/1) ... [2022-12-13 00:31:43,304 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:43" (1/1) ... [2022-12-13 00:31:43,318 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:43" (1/1) ... [2022-12-13 00:31:43,318 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:43" (1/1) ... [2022-12-13 00:31:43,323 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:43" (1/1) ... [2022-12-13 00:31:43,325 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:43" (1/1) ... [2022-12-13 00:31:43,326 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:43" (1/1) ... [2022-12-13 00:31:43,327 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:43" (1/1) ... [2022-12-13 00:31:43,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:31:43,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:31:43,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:31:43,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:31:43,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:43" (1/1) ... [2022-12-13 00:31:43,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:31:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:43,371 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:43,390 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:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:31:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:31:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:31:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:31:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:31:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:31:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:31:43,407 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:43,578 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:31:43,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:31:43,800 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:31:43,806 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:31:43,806 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:31:43,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:43 BoogieIcfgContainer [2022-12-13 00:31:43,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:31:43,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:31:43,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:31:43,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:31:43,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:31:42" (1/3) ... [2022-12-13 00:31:43,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dc588c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:43, skipping insertion in model container [2022-12-13 00:31:43,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:31:43" (2/3) ... [2022-12-13 00:31:43,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dc588c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:31:43, skipping insertion in model container [2022-12-13 00:31:43,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:31:43" (3/3) ... [2022-12-13 00:31:43,814 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-12-13 00:31:43,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:31:43,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:31:43,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:31:43,908 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 00:31:43,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 00:31:44,023 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-13 00:31:44,023 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:31:44,031 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:44,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 00:31:44,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:44,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:44,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:44,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:44,119 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-13 00:31:44,119 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:44,121 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:44,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 00:31:44,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-13 00:31:48,651 INFO L241 LiptonReduction]: Total number of compositions: 116 [2022-12-13 00:31:48,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:31:48,667 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;@4d8b8afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:31:48,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:31:48,674 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-13 00:31:48,674 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:31:48,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:48,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:31:48,675 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,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1688471119, now seen corresponding path program 1 times [2022-12-13 00:31:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:48,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338296637] [2022-12-13 00:31:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:48,956 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,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:48,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338296637] [2022-12-13 00:31:48,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338296637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:48,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:48,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530044264] [2022-12-13 00:31:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:48,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:48,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-13 00:31:48,983 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,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:48,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-13 00:31:48,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:50,254 INFO L130 PetriNetUnfolder]: 12108/20257 cut-off events. [2022-12-13 00:31:50,254 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2022-12-13 00:31:50,275 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,329 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 149 selfloop transitions, 8 changer transitions 2/171 dead transitions. [2022-12-13 00:31:50,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 675 flow [2022-12-13 00:31:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-12-13 00:31:50,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 00:31:50,345 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,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 675 flow [2022-12-13 00:31:50,354 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,357 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,359 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,362 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 00:31:50,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:50,364 INFO L89 Accepts]: Start accepts. Operand has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:50,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:50,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 108 transitions, 270 flow [2022-12-13 00:31:50,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,401 INFO L130 PetriNetUnfolder]: 105/641 cut-off events. [2022-12-13 00:31:50,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:31:50,404 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,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 5408 [2022-12-13 00:31:50,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:50,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 00:31:50,485 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 270 flow [2022-12-13 00:31:50,485 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,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:50,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:31:50,487 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,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 603354056, now seen corresponding path program 1 times [2022-12-13 00:31:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260465307] [2022-12-13 00:31:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:50,583 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,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260465307] [2022-12-13 00:31:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260465307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:50,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:50,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149452880] [2022-12-13 00:31:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:50,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:31:50,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:31:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:31:50,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 104 [2022-12-13 00:31:50,586 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,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:50,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 104 [2022-12-13 00:31:50,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:51,702 INFO L130 PetriNetUnfolder]: 11932/20366 cut-off events. [2022-12-13 00:31:51,702 INFO L131 PetriNetUnfolder]: For 342/369 co-relation queries the response was YES. [2022-12-13 00:31:51,716 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,750 INFO L137 encePairwiseOnDemand]: 95/104 looper letters, 131 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2022-12-13 00:31:51,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 156 transitions, 661 flow [2022-12-13 00:31:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:31:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:31:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-12-13 00:31:51,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-13 00:31:51,768 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,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 156 transitions, 661 flow [2022-12-13 00:31:51,774 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,776 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,776 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,777 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 00:31:51,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:51,777 INFO L89 Accepts]: Start accepts. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:51,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:51,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,830 INFO L130 PetriNetUnfolder]: 124/726 cut-off events. [2022-12-13 00:31:51,830 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 00:31:51,832 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:51,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 5928 [2022-12-13 00:31:51,860 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:51,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 00:31:51,862 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 309 flow [2022-12-13 00:31:51,862 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:51,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:51,863 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:31:51,863 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:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 85783273, now seen corresponding path program 1 times [2022-12-13 00:31:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126522462] [2022-12-13 00:31:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:51,944 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:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126522462] [2022-12-13 00:31:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126522462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737296900] [2022-12-13 00:31:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:51,953 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:51,955 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,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:52,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 00:31:52,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:52,138 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,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:52,167 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,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737296900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:31:52,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:31:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 00:31:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213839594] [2022-12-13 00:31:52,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:31:52,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 00:31:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 00:31:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 00:31:52,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-13 00:31:52,170 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,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:52,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-13 00:31:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:55,134 INFO L130 PetriNetUnfolder]: 29463/48122 cut-off events. [2022-12-13 00:31:55,134 INFO L131 PetriNetUnfolder]: For 3749/3749 co-relation queries the response was YES. [2022-12-13 00:31:55,191 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:55,291 INFO L137 encePairwiseOnDemand]: 82/104 looper letters, 494 selfloop transitions, 77 changer transitions 173/756 dead transitions. [2022-12-13 00:31:55,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 756 transitions, 3425 flow [2022-12-13 00:31:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 00:31:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 00:31:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 989 transitions. [2022-12-13 00:31:55,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5005060728744939 [2022-12-13 00:31:55,295 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:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 756 transitions, 3425 flow [2022-12-13 00:31:55,319 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:55,326 INFO L231 Difference]: Finished difference. Result has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:55,326 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:55,328 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 27 predicate places. [2022-12-13 00:31:55,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:55,328 INFO L89 Accepts]: Start accepts. Operand has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:55,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:55,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:55,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 188 transitions, 951 flow [2022-12-13 00:31:55,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 188 transitions, 951 flow [2022-12-13 00:31:55,458 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,458 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,458 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,458 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,458 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,459 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,459 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,459 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,459 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,459 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,459 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,459 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,459 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,459 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,460 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,460 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,460 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,460 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,460 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,461 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,461 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,461 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,461 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,461 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,461 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,461 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,464 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,466 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,466 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,466 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,467 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,467 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,467 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,467 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,467 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,467 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 222#true, 23#L1022-4true]) [2022-12-13 00:31:55,467 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,467 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,467 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,468 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,468 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,468 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,468 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,468 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,469 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,469 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,469 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,469 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,469 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,470 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,470 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 (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,470 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,470 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,470 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,470 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,470 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 (<= 800 ~top~0)), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,470 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,470 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,471 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 (<= 800 ~top~0)), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,471 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,471 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 (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,471 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,471 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,472 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,472 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,472 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 (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), 38#L973true, Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,472 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,472 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,472 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,472 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,472 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 (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 00:31:55,473 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,473 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 (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,473 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,473 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,473 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 (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,474 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,474 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 (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,474 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,474 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,475 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 (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,475 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,475 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 (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,475 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:31:55,475 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 00:31:55,498 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,498 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 00:31:55,498 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,498 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 00:31:55,499 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 00:31:55,509 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,510 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,510 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,510 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,510 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,511 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,511 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,511 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,511 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,511 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,512 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 23#L1022-4true]) [2022-12-13 00:31:55,512 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,512 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,512 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,512 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,512 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| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 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| 799) (<= ~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| 799), 196#true, 23#L1022-4true]) [2022-12-13 00:31:55,512 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 00:31:55,512 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 00:31:55,512 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 00:31:55,513 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 00:31:55,525 INFO L130 PetriNetUnfolder]: 558/2375 cut-off events. [2022-12-13 00:31:55,526 INFO L131 PetriNetUnfolder]: For 2103/2190 co-relation queries the response was YES. [2022-12-13 00:31:55,533 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:55,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 188 transitions, 951 flow [2022-12-13 00:31:55,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 8924 [2022-12-13 00:31:55,627 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:55,638 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:55,650 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:55,679 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:55,692 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:55,744 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:55,753 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:55,915 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:31:55,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 589 [2022-12-13 00:31:55,917 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 1023 flow [2022-12-13 00:31:55,917 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:55,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:55,917 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:55,926 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:56,123 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:56,124 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:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2022799586, now seen corresponding path program 1 times [2022-12-13 00:31:56,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:56,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789240249] [2022-12-13 00:31:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:56,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:56,155 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:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:56,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789240249] [2022-12-13 00:31:56,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789240249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:31:56,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:31:56,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:31:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888813201] [2022-12-13 00:31:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:31:56,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:31:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:56,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:31:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:31:56,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 124 [2022-12-13 00:31:56,157 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:56,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:56,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 124 [2022-12-13 00:31:56,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:59,173 INFO L130 PetriNetUnfolder]: 26034/43850 cut-off events. [2022-12-13 00:31:59,173 INFO L131 PetriNetUnfolder]: For 28225/30020 co-relation queries the response was YES. [2022-12-13 00:31:59,291 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:31:59,373 INFO L137 encePairwiseOnDemand]: 119/124 looper letters, 147 selfloop transitions, 0 changer transitions 0/181 dead transitions. [2022-12-13 00:31:59,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 181 transitions, 1242 flow [2022-12-13 00:31:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:31:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:31:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-12-13 00:31:59,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2022-12-13 00:31:59,374 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:31:59,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 181 transitions, 1242 flow [2022-12-13 00:31:59,668 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:31:59,671 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 844 flow [2022-12-13 00:31:59,671 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:31:59,672 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2022-12-13 00:31:59,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:59,672 INFO L89 Accepts]: Start accepts. Operand has 132 places, 181 transitions, 844 flow [2022-12-13 00:31:59,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:59,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:59,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 181 transitions, 844 flow [2022-12-13 00:31:59,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 181 transitions, 844 flow [2022-12-13 00:31:59,867 INFO L130 PetriNetUnfolder]: 483/2294 cut-off events. [2022-12-13 00:31:59,867 INFO L131 PetriNetUnfolder]: For 1527/1601 co-relation queries the response was YES. [2022-12-13 00:31:59,871 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:31:59,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 181 transitions, 844 flow [2022-12-13 00:31:59,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 8574 [2022-12-13 00:31:59,902 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:31:59,907 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:31:59,911 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:31:59,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:31:59,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 00:31:59,922 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 181 transitions, 856 flow [2022-12-13 00:31:59,923 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:31:59,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:59,923 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:31:59,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:31:59,923 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:31:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash -979973897, now seen corresponding path program 1 times [2022-12-13 00:31:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:59,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996745058] [2022-12-13 00:31:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:00,036 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:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996745058] [2022-12-13 00:32:00,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996745058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:00,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:00,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:32:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741550594] [2022-12-13 00:32:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:32:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:32:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:32:00,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 119 [2022-12-13 00:32:00,038 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:00,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:00,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 119 [2022-12-13 00:32:00,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:00,982 INFO L130 PetriNetUnfolder]: 8437/15041 cut-off events. [2022-12-13 00:32:00,982 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2022-12-13 00:32:01,013 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:01,035 INFO L137 encePairwiseOnDemand]: 97/119 looper letters, 62 selfloop transitions, 12 changer transitions 59/159 dead transitions. [2022-12-13 00:32:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 159 transitions, 879 flow [2022-12-13 00:32:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:32:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:32:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-12-13 00:32:01,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 00:32:01,038 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:01,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 159 transitions, 879 flow [2022-12-13 00:32:01,084 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:01,085 INFO L231 Difference]: Finished difference. Result has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:01,085 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:01,088 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2022-12-13 00:32:01,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:01,089 INFO L89 Accepts]: Start accepts. Operand has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:01,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:01,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:01,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 80 transitions, 325 flow [2022-12-13 00:32:01,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 325 flow [2022-12-13 00:32:01,117 INFO L130 PetriNetUnfolder]: 59/422 cut-off events. [2022-12-13 00:32:01,117 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 00:32:01,118 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:01,121 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 325 flow [2022-12-13 00:32:01,121 INFO L226 LiptonReduction]: Number of co-enabled transitions 1810 [2022-12-13 00:32:02,665 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 00:32:02,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1577 [2022-12-13 00:32:02,666 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 367 flow [2022-12-13 00:32:02,666 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:02,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:02,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:32:02,666 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:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1381920925, now seen corresponding path program 1 times [2022-12-13 00:32:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:02,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93631699] [2022-12-13 00:32:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:02,998 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:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:02,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93631699] [2022-12-13 00:32:02,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93631699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:02,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:32:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078855873] [2022-12-13 00:32:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:32:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:32:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:32:02,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-13 00:32:02,999 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:03,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:03,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-13 00:32:03,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:04,053 INFO L130 PetriNetUnfolder]: 6658/11972 cut-off events. [2022-12-13 00:32:04,053 INFO L131 PetriNetUnfolder]: For 6671/6680 co-relation queries the response was YES. [2022-12-13 00:32:04,068 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:04,084 INFO L137 encePairwiseOnDemand]: 52/67 looper letters, 160 selfloop transitions, 14 changer transitions 29/215 dead transitions. [2022-12-13 00:32:04,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 215 transitions, 1422 flow [2022-12-13 00:32:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:32:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:32:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2022-12-13 00:32:04,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.582089552238806 [2022-12-13 00:32:04,085 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:04,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 215 transitions, 1422 flow [2022-12-13 00:32:04,098 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:04,100 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:04,100 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:04,101 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -33 predicate places. [2022-12-13 00:32:04,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:04,101 INFO L89 Accepts]: Start accepts. Operand has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:04,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:04,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:04,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 439 flow [2022-12-13 00:32:04,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 439 flow [2022-12-13 00:32:04,137 INFO L130 PetriNetUnfolder]: 148/771 cut-off events. [2022-12-13 00:32:04,137 INFO L131 PetriNetUnfolder]: For 1148/1152 co-relation queries the response was YES. [2022-12-13 00:32:04,139 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:04,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 439 flow [2022-12-13 00:32:04,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 1706 [2022-12-13 00:32:05,109 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:32:05,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1009 [2022-12-13 00:32:05,110 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 441 flow [2022-12-13 00:32:05,110 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:05,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:05,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:05,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:32:05,111 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:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash 60048697, now seen corresponding path program 1 times [2022-12-13 00:32:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:05,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810795067] [2022-12-13 00:32:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:05,490 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:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810795067] [2022-12-13 00:32:05,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810795067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:05,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:05,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287614013] [2022-12-13 00:32:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:05,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:05,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2022-12-13 00:32:05,491 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:05,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:05,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2022-12-13 00:32:05,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:06,378 INFO L130 PetriNetUnfolder]: 7027/12731 cut-off events. [2022-12-13 00:32:06,379 INFO L131 PetriNetUnfolder]: For 14070/14070 co-relation queries the response was YES. [2022-12-13 00:32:06,400 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:06,419 INFO L137 encePairwiseOnDemand]: 49/63 looper letters, 130 selfloop transitions, 14 changer transitions 21/177 dead transitions. [2022-12-13 00:32:06,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 177 transitions, 1178 flow [2022-12-13 00:32:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:32:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:32:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2022-12-13 00:32:06,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-13 00:32:06,421 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:06,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 177 transitions, 1178 flow [2022-12-13 00:32:06,448 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:06,450 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,450 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:06,450 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -36 predicate places. [2022-12-13 00:32:06,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:06,451 INFO L89 Accepts]: Start accepts. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:06,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:06,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,489 INFO L130 PetriNetUnfolder]: 148/859 cut-off events. [2022-12-13 00:32:06,490 INFO L131 PetriNetUnfolder]: For 1302/1313 co-relation queries the response was YES. [2022-12-13 00:32:06,491 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:06,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-13 00:32:06,496 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:06,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 00:32:06,497 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 455 flow [2022-12-13 00:32:06,497 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:06,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:06,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:32:06,497 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:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 641784670, now seen corresponding path program 1 times [2022-12-13 00:32:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:06,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566469388] [2022-12-13 00:32:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:06,551 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:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:06,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566469388] [2022-12-13 00:32:06,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566469388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:06,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351026216] [2022-12-13 00:32:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:06,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:06,553 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:06,555 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:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:06,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 00:32:06,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:06,649 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:06,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:32:06,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351026216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:06,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:32:06,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-13 00:32:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983853196] [2022-12-13 00:32:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:06,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:32:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:32:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:32:06,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-13 00:32:06,650 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:06,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:06,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-13 00:32:06,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:07,365 INFO L130 PetriNetUnfolder]: 7383/13277 cut-off events. [2022-12-13 00:32:07,365 INFO L131 PetriNetUnfolder]: For 14382/14382 co-relation queries the response was YES. [2022-12-13 00:32:07,389 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:07,409 INFO L137 encePairwiseOnDemand]: 45/60 looper letters, 102 selfloop transitions, 13 changer transitions 4/128 dead transitions. [2022-12-13 00:32:07,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 128 transitions, 871 flow [2022-12-13 00:32:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:32:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:32:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-12-13 00:32:07,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 00:32:07,410 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:07,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 128 transitions, 871 flow [2022-12-13 00:32:07,438 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:07,440 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:07,440 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:07,440 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -32 predicate places. [2022-12-13 00:32:07,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:07,440 INFO L89 Accepts]: Start accepts. Operand has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:07,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:07,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:07,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 486 flow [2022-12-13 00:32:07,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:07,492 INFO L130 PetriNetUnfolder]: 129/880 cut-off events. [2022-12-13 00:32:07,493 INFO L131 PetriNetUnfolder]: For 1821/1831 co-relation queries the response was YES. [2022-12-13 00:32:07,495 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:07,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:07,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 00:32:07,501 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:07,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 00:32:07,502 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 486 flow [2022-12-13 00:32:07,502 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:07,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:07,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:07,545 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:07,706 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:07,708 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:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1582603438, now seen corresponding path program 1 times [2022-12-13 00:32:07,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:07,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138011543] [2022-12-13 00:32:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:08,021 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:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138011543] [2022-12-13 00:32:08,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138011543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:32:08,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:32:08,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:32:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17004855] [2022-12-13 00:32:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:32:08,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:32:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:32:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:32:08,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:32:08,023 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:08,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:08,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:32:08,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:09,333 INFO L130 PetriNetUnfolder]: 10465/19171 cut-off events. [2022-12-13 00:32:09,333 INFO L131 PetriNetUnfolder]: For 25653/25653 co-relation queries the response was YES. [2022-12-13 00:32:09,368 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:09,399 INFO L137 encePairwiseOnDemand]: 42/58 looper letters, 179 selfloop transitions, 43 changer transitions 3/234 dead transitions. [2022-12-13 00:32:09,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 1667 flow [2022-12-13 00:32:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 00:32:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 00:32:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-12-13 00:32:09,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.506896551724138 [2022-12-13 00:32:09,401 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:09,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 1667 flow [2022-12-13 00:32:09,460 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:09,462 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,462 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:09,463 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -24 predicate places. [2022-12-13 00:32:09,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:32:09,463 INFO L89 Accepts]: Start accepts. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:32:09,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:32:09,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,529 INFO L130 PetriNetUnfolder]: 187/1319 cut-off events. [2022-12-13 00:32:09,529 INFO L131 PetriNetUnfolder]: For 3036/3040 co-relation queries the response was YES. [2022-12-13 00:32:09,532 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:09,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 2084 [2022-12-13 00:32:09,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:32:09,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 00:32:09,541 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 842 flow [2022-12-13 00:32:09,541 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:09,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:32:09,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:32:09,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:32:09,541 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:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:32:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -511069260, now seen corresponding path program 2 times [2022-12-13 00:32:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:32:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155793920] [2022-12-13 00:32:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:32:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:32:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:32:09,945 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:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:32:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155793920] [2022-12-13 00:32:09,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155793920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:32:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924953884] [2022-12-13 00:32:09,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:32:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:32:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:32:09,947 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:09,950 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:10,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 00:32:10,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:32:10,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 00:32:10,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:32:10,076 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:32:10,077 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:32:10,140 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 17 treesize of output 13 [2022-12-13 00:32:10,260 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:10,355 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,974 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,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:32:17,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_294) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-13 00:32:17,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:32:17,063 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:17,071 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:17,076 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:17,105 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:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924953884] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:32:17,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:32:17,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:32:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926146598] [2022-12-13 00:32:17,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:32:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:32:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:32:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:32:17,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=195, Unknown=1, NotChecked=28, Total=272 [2022-12-13 00:32:17,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:32:17,107 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:17,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:32:17,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:32:17,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:32:18,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:32:20,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:32:22,891 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:24,899 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:26,915 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:28,927 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,688 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:33,704 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,719 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:37,730 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:39,743 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:41,773 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:43,850 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:45,860 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:47,870 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,663 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,701 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:54,769 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,801 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,809 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,819 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,877 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:04,900 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:06,919 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:08,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:33:11,018 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:33:13,127 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:15,147 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:17,220 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:19,392 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:21,470 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,457 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:27,072 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:29,109 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:31,204 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:33,250 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:35,390 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:37,404 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:39,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:41,440 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:43,704 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,773 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:47,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:50,534 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,608 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:56,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:33:58,816 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:00,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:02,878 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:05,201 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:07,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:09,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 00:34:13,237 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:15,245 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:17,359 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,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:34:21,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:34:25,006 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:25,310 INFO L130 PetriNetUnfolder]: 13597/24959 cut-off events. [2022-12-13 00:34:25,310 INFO L131 PetriNetUnfolder]: For 40919/40919 co-relation queries the response was YES. [2022-12-13 00:34:25,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68622 conditions, 24959 events. 13597/24959 cut-off events. For 40919/40919 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 217989 event pairs, 3239 based on Foata normal form. 23/14519 useless extension candidates. Maximal degree in co-relation 59725. Up to 7991 conditions per place. [2022-12-13 00:34:25,432 INFO L137 encePairwiseOnDemand]: 35/58 looper letters, 180 selfloop transitions, 70 changer transitions 20/279 dead transitions. [2022-12-13 00:34:25,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 279 transitions, 2221 flow [2022-12-13 00:34:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:34:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:34:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 323 transitions. [2022-12-13 00:34:25,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5062695924764891 [2022-12-13 00:34:25,434 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 842 flow. Second operand 11 states and 323 transitions. [2022-12-13 00:34:25,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 279 transitions, 2221 flow [2022-12-13 00:34:25,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 279 transitions, 2150 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 00:34:25,543 INFO L231 Difference]: Finished difference. Result has 99 places, 132 transitions, 1292 flow [2022-12-13 00:34:25,543 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=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1292, PETRI_PLACES=99, PETRI_TRANSITIONS=132} [2022-12-13 00:34:25,543 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -12 predicate places. [2022-12-13 00:34:25,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:34:25,544 INFO L89 Accepts]: Start accepts. Operand has 99 places, 132 transitions, 1292 flow [2022-12-13 00:34:25,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:34:25,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:25,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 132 transitions, 1292 flow [2022-12-13 00:34:25,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 132 transitions, 1292 flow [2022-12-13 00:34:25,736 INFO L130 PetriNetUnfolder]: 776/3581 cut-off events. [2022-12-13 00:34:25,736 INFO L131 PetriNetUnfolder]: For 9911/10017 co-relation queries the response was YES. [2022-12-13 00:34:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 3581 events. 776/3581 cut-off events. For 9911/10017 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 40140 event pairs, 117 based on Foata normal form. 8/2328 useless extension candidates. Maximal degree in co-relation 7275. Up to 679 conditions per place. [2022-12-13 00:34:26,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 132 transitions, 1292 flow [2022-12-13 00:34:26,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 2664 [2022-12-13 00:34:26,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:34:26,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 701 [2022-12-13 00:34:26,245 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 131 transitions, 1288 flow [2022-12-13 00:34:26,246 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:26,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:34:26,246 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:34:26,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 00:34:26,446 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:34:26,446 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:34:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:34:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash -971263192, now seen corresponding path program 1 times [2022-12-13 00:34:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:34:26,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862702968] [2022-12-13 00:34:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:34:26,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:34:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:34:26,523 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:34:26,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:34:26,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862702968] [2022-12-13 00:34:26,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862702968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:34:26,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446902073] [2022-12-13 00:34:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:34:26,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:34:26,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:34:26,525 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:34:26,526 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:34:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:34:26,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 00:34:26,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:34:26,641 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:34:26,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:34:26,691 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:34:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446902073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:34:26,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:34:26,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 00:34:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069389670] [2022-12-13 00:34:26,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:34:26,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 00:34:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:34:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 00:34:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-13 00:34:26,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-13 00:34:26,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 131 transitions, 1288 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:34:26,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:34:26,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-13 00:34:26,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:34:29,431 INFO L130 PetriNetUnfolder]: 17868/32925 cut-off events. [2022-12-13 00:34:29,431 INFO L131 PetriNetUnfolder]: For 68367/68367 co-relation queries the response was YES. [2022-12-13 00:34:29,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102388 conditions, 32925 events. 17868/32925 cut-off events. For 68367/68367 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 291378 event pairs, 3853 based on Foata normal form. 335/25717 useless extension candidates. Maximal degree in co-relation 78886. Up to 6268 conditions per place. [2022-12-13 00:34:29,568 INFO L137 encePairwiseOnDemand]: 40/60 looper letters, 351 selfloop transitions, 95 changer transitions 14/469 dead transitions. [2022-12-13 00:34:29,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 469 transitions, 3996 flow [2022-12-13 00:34:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:34:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:34:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 509 transitions. [2022-12-13 00:34:29,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47129629629629627 [2022-12-13 00:34:29,571 INFO L175 Difference]: Start difference. First operand has 98 places, 131 transitions, 1288 flow. Second operand 18 states and 509 transitions. [2022-12-13 00:34:29,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 469 transitions, 3996 flow [2022-12-13 00:34:29,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 469 transitions, 3816 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-13 00:34:29,767 INFO L231 Difference]: Finished difference. Result has 120 places, 180 transitions, 2178 flow [2022-12-13 00:34:29,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2178, PETRI_PLACES=120, PETRI_TRANSITIONS=180} [2022-12-13 00:34:29,768 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2022-12-13 00:34:29,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:34:29,768 INFO L89 Accepts]: Start accepts. Operand has 120 places, 180 transitions, 2178 flow [2022-12-13 00:34:29,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:34:29,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:29,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 180 transitions, 2178 flow [2022-12-13 00:34:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 180 transitions, 2178 flow [2022-12-13 00:34:30,102 INFO L130 PetriNetUnfolder]: 1093/4536 cut-off events. [2022-12-13 00:34:30,103 INFO L131 PetriNetUnfolder]: For 20530/20737 co-relation queries the response was YES. [2022-12-13 00:34:30,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13460 conditions, 4536 events. 1093/4536 cut-off events. For 20530/20737 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 50714 event pairs, 270 based on Foata normal form. 9/2972 useless extension candidates. Maximal degree in co-relation 12672. Up to 921 conditions per place. [2022-12-13 00:34:30,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 180 transitions, 2178 flow [2022-12-13 00:34:30,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 3548 [2022-12-13 00:34:30,308 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:34:30,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-13 00:34:30,309 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 180 transitions, 2209 flow [2022-12-13 00:34:30,309 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:34:30,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:34:30,310 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:34:30,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 00:34:30,511 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:34:30,511 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:34:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:34:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1481343952, now seen corresponding path program 1 times [2022-12-13 00:34:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:34:30,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571400902] [2022-12-13 00:34:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:34:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:34:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:34:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:34:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:34:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571400902] [2022-12-13 00:34:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571400902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:34:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903218714] [2022-12-13 00:34:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:34:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:34:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:34:31,410 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:34:31,412 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:34:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:34:31,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 00:34:31,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:34:31,622 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 18 treesize of output 14 [2022-12-13 00:34:31,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 00:34:31,687 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:34:31,798 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:34:33,828 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_9_48 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_9_48 1) 0) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ .cse0 4294967297 aux_mod_v_arrayElimCell_9_48)) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|)))) is different from true [2022-12-13 00:34:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 00:34:33,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:34:33,985 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:34:33,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903218714] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:34:33,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:34:33,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2022-12-13 00:34:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229507201] [2022-12-13 00:34:33,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:34:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 00:34:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:34:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 00:34:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=158, Unknown=1, NotChecked=26, Total=240 [2022-12-13 00:34:33,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 67 [2022-12-13 00:34:33,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 180 transitions, 2209 flow. Second operand has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 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:33,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:34:33,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 67 [2022-12-13 00:34:33,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:34:45,120 INFO L130 PetriNetUnfolder]: 26705/49199 cut-off events. [2022-12-13 00:34:45,120 INFO L131 PetriNetUnfolder]: For 128360/128360 co-relation queries the response was YES. [2022-12-13 00:34:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157466 conditions, 49199 events. 26705/49199 cut-off events. For 128360/128360 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 461884 event pairs, 7278 based on Foata normal form. 65/38043 useless extension candidates. Maximal degree in co-relation 148767. Up to 19503 conditions per place. [2022-12-13 00:34:45,386 INFO L137 encePairwiseOnDemand]: 40/67 looper letters, 399 selfloop transitions, 89 changer transitions 73/570 dead transitions. [2022-12-13 00:34:45,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 570 transitions, 5929 flow [2022-12-13 00:34:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 00:34:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 00:34:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 579 transitions. [2022-12-13 00:34:45,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43208955223880596 [2022-12-13 00:34:45,388 INFO L175 Difference]: Start difference. First operand has 120 places, 180 transitions, 2209 flow. Second operand 20 states and 579 transitions. [2022-12-13 00:34:45,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 570 transitions, 5929 flow [2022-12-13 00:34:45,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 570 transitions, 5579 flow, removed 175 selfloop flow, removed 0 redundant places. [2022-12-13 00:34:45,894 INFO L231 Difference]: Finished difference. Result has 151 places, 230 transitions, 3018 flow [2022-12-13 00:34:45,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3018, PETRI_PLACES=151, PETRI_TRANSITIONS=230} [2022-12-13 00:34:45,895 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2022-12-13 00:34:45,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:34:45,895 INFO L89 Accepts]: Start accepts. Operand has 151 places, 230 transitions, 3018 flow [2022-12-13 00:34:45,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:34:45,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:45,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 230 transitions, 3018 flow [2022-12-13 00:34:45,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 230 transitions, 3018 flow [2022-12-13 00:34:46,769 INFO L130 PetriNetUnfolder]: 2959/11115 cut-off events. [2022-12-13 00:34:46,769 INFO L131 PetriNetUnfolder]: For 45445/45953 co-relation queries the response was YES. [2022-12-13 00:34:46,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33081 conditions, 11115 events. 2959/11115 cut-off events. For 45445/45953 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 138126 event pairs, 1125 based on Foata normal form. 28/7149 useless extension candidates. Maximal degree in co-relation 31757. Up to 2270 conditions per place. [2022-12-13 00:34:46,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 230 transitions, 3018 flow [2022-12-13 00:34:46,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 4402 [2022-12-13 00:34:48,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [637] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_25|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 00:34:48,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [506] L1022-4-->L1023: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_3|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 00:34:48,921 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:34:48,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3027 [2022-12-13 00:34:48,922 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 228 transitions, 3068 flow [2022-12-13 00:34:48,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 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:48,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:34:48,923 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:34:48,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 00:34:49,139 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:34:49,144 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:34:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:34:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1521205271, now seen corresponding path program 1 times [2022-12-13 00:34:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:34:49,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376067231] [2022-12-13 00:34:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:34:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:34:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:34:49,445 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:34:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:34:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376067231] [2022-12-13 00:34:49,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376067231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:34:49,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:34:49,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:34:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502493557] [2022-12-13 00:34:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:34:49,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:34:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:34:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:34:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:34:49,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 76 [2022-12-13 00:34:49,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 228 transitions, 3068 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:34:49,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:34:49,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 76 [2022-12-13 00:34:49,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:34:57,831 INFO L130 PetriNetUnfolder]: 37712/69269 cut-off events. [2022-12-13 00:34:57,832 INFO L131 PetriNetUnfolder]: For 215832/215832 co-relation queries the response was YES. [2022-12-13 00:34:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248117 conditions, 69269 events. 37712/69269 cut-off events. For 215832/215832 co-relation queries the response was YES. Maximal size of possible extension queue 2283. Compared 678072 event pairs, 21891 based on Foata normal form. 23/53473 useless extension candidates. Maximal degree in co-relation 237475. Up to 37481 conditions per place. [2022-12-13 00:34:58,423 INFO L137 encePairwiseOnDemand]: 55/76 looper letters, 330 selfloop transitions, 66 changer transitions 1/406 dead transitions. [2022-12-13 00:34:58,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 406 transitions, 5544 flow [2022-12-13 00:34:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:34:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:34:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2022-12-13 00:34:58,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3932748538011696 [2022-12-13 00:34:58,425 INFO L175 Difference]: Start difference. First operand has 149 places, 228 transitions, 3068 flow. Second operand 9 states and 269 transitions. [2022-12-13 00:34:58,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 406 transitions, 5544 flow [2022-12-13 00:34:59,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 406 transitions, 5438 flow, removed 51 selfloop flow, removed 3 redundant places. [2022-12-13 00:34:59,901 INFO L231 Difference]: Finished difference. Result has 157 places, 265 transitions, 3850 flow [2022-12-13 00:34:59,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=3000, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3850, PETRI_PLACES=157, PETRI_TRANSITIONS=265} [2022-12-13 00:34:59,902 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 46 predicate places. [2022-12-13 00:34:59,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:34:59,902 INFO L89 Accepts]: Start accepts. Operand has 157 places, 265 transitions, 3850 flow [2022-12-13 00:34:59,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:34:59,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:59,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 265 transitions, 3850 flow [2022-12-13 00:34:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 265 transitions, 3850 flow [2022-12-13 00:35:01,003 INFO L130 PetriNetUnfolder]: 3543/12973 cut-off events. [2022-12-13 00:35:01,003 INFO L131 PetriNetUnfolder]: For 55368/56189 co-relation queries the response was YES. [2022-12-13 00:35:01,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38761 conditions, 12973 events. 3543/12973 cut-off events. For 55368/56189 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 168146 event pairs, 1702 based on Foata normal form. 31/8219 useless extension candidates. Maximal degree in co-relation 37474. Up to 2956 conditions per place. [2022-12-13 00:35:01,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 265 transitions, 3850 flow [2022-12-13 00:35:01,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 5064 [2022-12-13 00:35:01,163 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:01,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1262 [2022-12-13 00:35:01,164 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 265 transitions, 3850 flow [2022-12-13 00:35:01,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:35:01,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:01,164 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:01,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:35:01,165 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:35:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 242740761, now seen corresponding path program 2 times [2022-12-13 00:35:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:01,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501359009] [2022-12-13 00:35:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:02,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501359009] [2022-12-13 00:35:02,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501359009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:35:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519686221] [2022-12-13 00:35:02,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:35:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:02,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:35:02,350 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:35:02,352 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:35:02,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 00:35:02,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:35:02,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 00:35:02,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:35:02,460 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:35:02,461 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:35:02,516 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 17 treesize of output 13 [2022-12-13 00:35:02,614 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:35:02,693 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:04,722 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_14_49 Int) (aux_div_v_arrayElimCell_14_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_14_49 4294967296))) (and (< aux_mod_v_arrayElimCell_14_49 4294967296) (<= (+ .cse0 aux_mod_v_arrayElimCell_14_49 1) 0) (< 0 (+ .cse0 aux_mod_v_arrayElimCell_14_49 4294967297)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_14_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_14_49)))) is different from true [2022-12-13 00:35:04,722 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:35:04,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:35:04,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519686221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:04,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:35:04,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-12-13 00:35:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726626135] [2022-12-13 00:35:04,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:04,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:35:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:35:04,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2022-12-13 00:35:04,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 76 [2022-12-13 00:35:04,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 265 transitions, 3850 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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:04,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:04,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 76 [2022-12-13 00:35:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:14,707 INFO L130 PetriNetUnfolder]: 37984/69717 cut-off events. [2022-12-13 00:35:14,708 INFO L131 PetriNetUnfolder]: For 231412/231412 co-relation queries the response was YES. [2022-12-13 00:35:15,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252501 conditions, 69717 events. 37984/69717 cut-off events. For 231412/231412 co-relation queries the response was YES. Maximal size of possible extension queue 2368. Compared 681501 event pairs, 16819 based on Foata normal form. 23/53815 useless extension candidates. Maximal degree in co-relation 241832. Up to 51071 conditions per place. [2022-12-13 00:35:15,265 INFO L137 encePairwiseOnDemand]: 53/76 looper letters, 254 selfloop transitions, 57 changer transitions 0/320 dead transitions. [2022-12-13 00:35:15,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 320 transitions, 4776 flow [2022-12-13 00:35:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:35:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:35:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2022-12-13 00:35:15,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 00:35:15,266 INFO L175 Difference]: Start difference. First operand has 156 places, 265 transitions, 3850 flow. Second operand 7 states and 190 transitions. [2022-12-13 00:35:15,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 320 transitions, 4776 flow [2022-12-13 00:35:16,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 320 transitions, 4762 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 00:35:16,728 INFO L231 Difference]: Finished difference. Result has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:16,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4130, PETRI_PLACES=161, PETRI_TRANSITIONS=276} [2022-12-13 00:35:16,729 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 50 predicate places. [2022-12-13 00:35:16,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:16,729 INFO L89 Accepts]: Start accepts. Operand has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:16,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:16,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:16,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:16,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:18,272 INFO L130 PetriNetUnfolder]: 4385/16116 cut-off events. [2022-12-13 00:35:18,272 INFO L131 PetriNetUnfolder]: For 79538/83152 co-relation queries the response was YES. [2022-12-13 00:35:18,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52998 conditions, 16116 events. 4385/16116 cut-off events. For 79538/83152 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 212996 event pairs, 1684 based on Foata normal form. 30/10343 useless extension candidates. Maximal degree in co-relation 51121. Up to 3552 conditions per place. [2022-12-13 00:35:18,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:18,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 5010 [2022-12-13 00:35:18,490 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:18,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1761 [2022-12-13 00:35:18,491 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 276 transitions, 4130 flow [2022-12-13 00:35:18,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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:18,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:18,491 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:18,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 00:35:18,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:18,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:35:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1301137091, now seen corresponding path program 1 times [2022-12-13 00:35:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:18,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499419463] [2022-12-13 00:35:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499419463] [2022-12-13 00:35:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499419463] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:35:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969307996] [2022-12-13 00:35:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:19,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:35:19,172 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:35:19,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 00:35:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:19,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 00:35:19,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:35:19,308 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 00:35:19,308 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:35:19,346 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 18 treesize of output 14 [2022-12-13 00:35:19,404 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:35:19,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 72 treesize of output 43 [2022-12-13 00:35:19,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 00:35:19,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 46 [2022-12-13 00:35:21,690 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_20_49 Int) (aux_mod_v_arrayElimCell_20_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_20_49 4294967296))) (and (<= (+ aux_mod_v_arrayElimCell_20_49 .cse0 1) 0) (< aux_mod_v_arrayElimCell_20_49 4294967296) (< 0 (+ aux_mod_v_arrayElimCell_20_49 4294967297 .cse0)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_20_49)) 4294967296)) (<= 4294966496 aux_mod_v_arrayElimCell_20_49)))) is different from true [2022-12-13 00:35:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 00:35:21,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:35:21,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:35:21,991 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 30 treesize of output 31 [2022-12-13 00:35:22,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:35:22,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 72 [2022-12-13 00:35:22,006 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 29 treesize of output 22 [2022-12-13 00:35:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:35:22,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969307996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:35:22,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:35:22,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 00:35:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923135680] [2022-12-13 00:35:22,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:35:22,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:35:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:35:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=235, Unknown=7, NotChecked=34, Total=380 [2022-12-13 00:35:22,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 76 [2022-12-13 00:35:22,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 276 transitions, 4130 flow. Second operand has 20 states, 20 states have (on average 11.25) internal successors, (225), 20 states have internal predecessors, (225), 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:22,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:22,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 76 [2022-12-13 00:35:22,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:22,909 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_600 (Array Int Int)) (|v_t2Thread1of1ForFork0_get_top_#res#1_120| Int)) (or (not (< 0 |v_t2Thread1of1ForFork0_get_top_#res#1_120|)) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_600) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |v_t2Thread1of1ForFork0_get_top_#res#1_120| 4) (- 4))) 4294967296) 4294967294)) (< c_~top~0 |v_t2Thread1of1ForFork0_get_top_#res#1_120|))) (forall ((|v_t2Thread1of1ForFork0_get_top_#res#1_120| Int)) (or (not (< 0 |v_t2Thread1of1ForFork0_get_top_#res#1_120|)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |v_t2Thread1of1ForFork0_get_top_#res#1_120| 4) (- 4))) 4294967296))) (< c_~top~0 |v_t2Thread1of1ForFork0_get_top_#res#1_120|)))) is different from false [2022-12-13 00:35:43,480 INFO L130 PetriNetUnfolder]: 56560/103902 cut-off events. [2022-12-13 00:35:43,480 INFO L131 PetriNetUnfolder]: For 431114/431114 co-relation queries the response was YES. [2022-12-13 00:35:44,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418257 conditions, 103902 events. 56560/103902 cut-off events. For 431114/431114 co-relation queries the response was YES. Maximal size of possible extension queue 3648. Compared 1058254 event pairs, 9620 based on Foata normal form. 180/80325 useless extension candidates. Maximal degree in co-relation 405362. Up to 38708 conditions per place. [2022-12-13 00:35:44,394 INFO L137 encePairwiseOnDemand]: 32/76 looper letters, 474 selfloop transitions, 278 changer transitions 160/921 dead transitions. [2022-12-13 00:35:44,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 921 transitions, 11754 flow [2022-12-13 00:35:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 00:35:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 00:35:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 849 transitions. [2022-12-13 00:35:44,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3852087114337568 [2022-12-13 00:35:44,397 INFO L175 Difference]: Start difference. First operand has 161 places, 276 transitions, 4130 flow. Second operand 29 states and 849 transitions. [2022-12-13 00:35:44,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 921 transitions, 11754 flow [2022-12-13 00:35:47,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 921 transitions, 11731 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 00:35:47,093 INFO L231 Difference]: Finished difference. Result has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:47,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=4067, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=7757, PETRI_PLACES=200, PETRI_TRANSITIONS=427} [2022-12-13 00:35:47,094 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 89 predicate places. [2022-12-13 00:35:47,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:47,094 INFO L89 Accepts]: Start accepts. Operand has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:47,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:47,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:47,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:51,875 INFO L130 PetriNetUnfolder]: 14899/42237 cut-off events. [2022-12-13 00:35:51,876 INFO L131 PetriNetUnfolder]: For 284955/294383 co-relation queries the response was YES. [2022-12-13 00:35:52,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167068 conditions, 42237 events. 14899/42237 cut-off events. For 284955/294383 co-relation queries the response was YES. Maximal size of possible extension queue 2649. Compared 578597 event pairs, 9028 based on Foata normal form. 115/28936 useless extension candidates. Maximal degree in co-relation 163682. Up to 18689 conditions per place. [2022-12-13 00:35:52,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:52,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 7562 [2022-12-13 00:35:52,890 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:52,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5797 [2022-12-13 00:35:52,891 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 427 transitions, 7757 flow [2022-12-13 00:35:52,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.25) internal successors, (225), 20 states have internal predecessors, (225), 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:52,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:52,891 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:52,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 00:35:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:53,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:35:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1666546603, now seen corresponding path program 2 times [2022-12-13 00:35:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688036152] [2022-12-13 00:35:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:53,990 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:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688036152] [2022-12-13 00:35:53,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688036152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:35:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545755737] [2022-12-13 00:35:53,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:35:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:35:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:35:53,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:35:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 00:35:54,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 00:35:54,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:35:54,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-13 00:35:54,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:35:54,152 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 00:35:54,152 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:35:54,194 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 18 treesize of output 14 [2022-12-13 00:35:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 00:35:54,252 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:54,335 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 43 treesize of output 38 [2022-12-13 00:35:54,530 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 79 treesize of output 46 [2022-12-13 00:35:56,560 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_28_49 Int) (aux_div_v_arrayElimCell_28_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_28_49 4294967296))) (and (< aux_mod_v_arrayElimCell_28_49 4294967296) (<= 4294966496 aux_mod_v_arrayElimCell_28_49) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_28_49) 4294967295) 4294967296)) (<= (+ aux_mod_v_arrayElimCell_28_49 1 .cse0) 0) (< 0 (+ aux_mod_v_arrayElimCell_28_49 4294967297 .cse0))))) is different from true [2022-12-13 00:35:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 00:35:56,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:35:56,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_673) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) is different from false [2022-12-13 00:35:56,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_673) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-13 00:35:56,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 00:35:56,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:35:56,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2022-12-13 00:35:56,783 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 89 treesize of output 49 [2022-12-13 00:35:56,786 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:35:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 00:35:56,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545755737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:35:56,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:35:56,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-12-13 00:35:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980657859] [2022-12-13 00:35:56,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:35:56,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 00:35:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:56,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 00:35:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=266, Unknown=3, NotChecked=108, Total=462 [2022-12-13 00:35:56,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 76 [2022-12-13 00:35:56,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 427 transitions, 7757 flow. Second operand has 22 states, 22 states have (on average 11.181818181818182) internal successors, (246), 22 states have internal predecessors, (246), 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:56,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:56,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 76 [2022-12-13 00:35:56,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:36:10,259 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4)))) (and (forall ((v_ArrVal_673 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_673) |c_~#arr~0.base|) .cse0) 4294967296) 4294967294))) (not (= (+ 2 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (forall ((v_ArrVal_672 Int) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_225| Int) (v_ArrVal_673 (Array Int Int)) (|v_t1Thread1of1ForFork1_get_top_#res#1_188| Int)) (or (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_188|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_188| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_225|) v_ArrVal_672)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_673) |c_~#arr~0.base|) .cse0) 4294967296))) (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_225| |c_~#arr~0.offset|))))) is different from false [2022-12-13 00:36:27,574 INFO L130 PetriNetUnfolder]: 78829/145817 cut-off events. [2022-12-13 00:36:27,574 INFO L131 PetriNetUnfolder]: For 1046653/1046653 co-relation queries the response was YES. [2022-12-13 00:36:28,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736461 conditions, 145817 events. 78829/145817 cut-off events. For 1046653/1046653 co-relation queries the response was YES. Maximal size of possible extension queue 4055. Compared 1488554 event pairs, 20684 based on Foata normal form. 186/113103 useless extension candidates. Maximal degree in co-relation 711337. Up to 69467 conditions per place. [2022-12-13 00:36:29,282 INFO L137 encePairwiseOnDemand]: 28/76 looper letters, 744 selfloop transitions, 306 changer transitions 95/1154 dead transitions. [2022-12-13 00:36:29,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1154 transitions, 17936 flow [2022-12-13 00:36:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 00:36:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 00:36:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 868 transitions. [2022-12-13 00:36:29,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3569078947368421 [2022-12-13 00:36:29,284 INFO L175 Difference]: Start difference. First operand has 200 places, 427 transitions, 7757 flow. Second operand 32 states and 868 transitions. [2022-12-13 00:36:29,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1154 transitions, 17936 flow [2022-12-13 00:36:36,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1154 transitions, 17221 flow, removed 288 selfloop flow, removed 5 redundant places. [2022-12-13 00:36:36,563 INFO L231 Difference]: Finished difference. Result has 243 places, 575 transitions, 10426 flow [2022-12-13 00:36:36,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=6535, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=10426, PETRI_PLACES=243, PETRI_TRANSITIONS=575} [2022-12-13 00:36:36,563 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 132 predicate places. [2022-12-13 00:36:36,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:36:36,564 INFO L89 Accepts]: Start accepts. Operand has 243 places, 575 transitions, 10426 flow [2022-12-13 00:36:36,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:36:36,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:36:36,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 575 transitions, 10426 flow [2022-12-13 00:36:36,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 575 transitions, 10426 flow