/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:42:38,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:42:38,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:42:38,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:42:38,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:42:38,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:42:38,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:42:38,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:42:38,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:42:38,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:42:38,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:42:38,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:42:38,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:42:38,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:42:38,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:42:38,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:42:38,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:42:38,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:42:38,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:42:38,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:42:38,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:42:38,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:42:38,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:42:38,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:42:38,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:42:38,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:42:38,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:42:38,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:42:38,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:42:38,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:42:38,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:42:38,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:42:38,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:42:38,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:42:38,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:42:38,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:42:38,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:42:38,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:42:38,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:42:38,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:42:38,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:42:38,734 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:42:38,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:42:38,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:42:38,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:42:38,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:42:38,759 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:42:38,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:42:38,759 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:42:38,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:42:38,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:42:38,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:42:38,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:42:38,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:42:38,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:42:38,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:42:38,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:42:38,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:42:38,762 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 11:42:39,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:42:39,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:42:39,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:42:39,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:42:39,040 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:42:39,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-13 11:42:40,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:42:40,250 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:42:40,250 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2022-12-13 11:42:40,260 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d39bdef99/6304cf92220a4d58a05e1ae121274169/FLAG3ab846977 [2022-12-13 11:42:40,272 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d39bdef99/6304cf92220a4d58a05e1ae121274169 [2022-12-13 11:42:40,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:42:40,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:42:40,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:42:40,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:42:40,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:42:40,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fff3bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40, skipping insertion in model container [2022-12-13 11:42:40,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:42:40,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:42:40,691 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-1.i[41530,41543] [2022-12-13 11:42:40,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:42:40,726 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:42:40,756 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-1.i[41530,41543] [2022-12-13 11:42:40,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:42:40,809 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:42:40,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40 WrapperNode [2022-12-13 11:42:40,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:42:40,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:42:40,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:42:40,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:42:40,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,873 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-13 11:42:40,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:42:40,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:42:40,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:42:40,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:42:40,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:42:40,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:42:40,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:42:40,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:42:40,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (1/1) ... [2022-12-13 11:42:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:42:40,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:42:40,932 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 11:42:40,934 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 11:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 11:42:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 11:42:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 11:42:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:42:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:42:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:42:40,963 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 11:42:41,068 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:42:41,069 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:42:41,327 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:42:41,333 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:42:41,333 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:42:41,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:42:41 BoogieIcfgContainer [2022-12-13 11:42:41,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:42:41,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:42:41,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:42:41,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:42:41,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:42:40" (1/3) ... [2022-12-13 11:42:41,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4e487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:42:41, skipping insertion in model container [2022-12-13 11:42:41,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:40" (2/3) ... [2022-12-13 11:42:41,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4e487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:42:41, skipping insertion in model container [2022-12-13 11:42:41,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:42:41" (3/3) ... [2022-12-13 11:42:41,341 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-12-13 11:42:41,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:42:41,356 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:42:41,356 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:42:41,443 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:42:41,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-13 11:42:41,567 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-13 11:42:41,567 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:42:41,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 155 events. 10/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 375 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-13 11:42:41,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-13 11:42:41,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-13 11:42:41,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:41,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-13 11:42:41,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 146 transitions, 301 flow [2022-12-13 11:42:41,657 INFO L130 PetriNetUnfolder]: 10/146 cut-off events. [2022-12-13 11:42:41,657 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:42:41,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 10/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 308 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-13 11:42:41,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-13 11:42:41,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-13 11:42:46,506 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 11:42:46,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:42:46,521 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;@41c1107a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:42:46,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:42:46,527 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-13 11:42:46,527 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:42:46,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:46,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 11:42:46,528 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 11:42:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -894186448, now seen corresponding path program 1 times [2022-12-13 11:42:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558204957] [2022-12-13 11:42:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:46,741 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 11:42:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:46,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558204957] [2022-12-13 11:42:46,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558204957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:46,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:46,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:46,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895306341] [2022-12-13 11:42:46,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:46,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:46,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 115 [2022-12-13 11:42:46,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 11:42:46,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:46,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 115 [2022-12-13 11:42:46,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:48,179 INFO L130 PetriNetUnfolder]: 16941/27776 cut-off events. [2022-12-13 11:42:48,179 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-13 11:42:48,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54812 conditions, 27776 events. 16941/27776 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 213996 event pairs, 5800 based on Foata normal form. 0/8458 useless extension candidates. Maximal degree in co-relation 54081. Up to 15820 conditions per place. [2022-12-13 11:42:48,293 INFO L137 encePairwiseOnDemand]: 94/115 looper letters, 174 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2022-12-13 11:42:48,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 777 flow [2022-12-13 11:42:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2022-12-13 11:42:48,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.672463768115942 [2022-12-13 11:42:48,304 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 239 flow. Second operand 3 states and 232 transitions. [2022-12-13 11:42:48,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 196 transitions, 777 flow [2022-12-13 11:42:48,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 196 transitions, 769 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:42:48,313 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2022-12-13 11:42:48,317 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-12-13 11:42:48,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:48,318 INFO L89 Accepts]: Start accepts. Operand has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:48,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:48,321 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,370 INFO L130 PetriNetUnfolder]: 186/862 cut-off events. [2022-12-13 11:42:48,371 INFO L131 PetriNetUnfolder]: For 21/33 co-relation queries the response was YES. [2022-12-13 11:42:48,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 862 events. 186/862 cut-off events. For 21/33 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7459 event pairs, 6 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 1196. Up to 202 conditions per place. [2022-12-13 11:42:48,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 6968 [2022-12-13 11:42:48,462 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:42:48,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 11:42:48,468 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 322 flow [2022-12-13 11:42:48,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 11:42:48,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:48,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:48,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:42:48,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2068407880, now seen corresponding path program 1 times [2022-12-13 11:42:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940187732] [2022-12-13 11:42:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:48,575 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 11:42:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:48,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940187732] [2022-12-13 11:42:48,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940187732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:48,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:48,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446382412] [2022-12-13 11:42:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:48,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 111 [2022-12-13 11:42:48,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 11:42:48,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:48,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 111 [2022-12-13 11:42:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:49,982 INFO L130 PetriNetUnfolder]: 16433/27236 cut-off events. [2022-12-13 11:42:49,982 INFO L131 PetriNetUnfolder]: For 1355/1540 co-relation queries the response was YES. [2022-12-13 11:42:50,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57497 conditions, 27236 events. 16433/27236 cut-off events. For 1355/1540 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 211107 event pairs, 7920 based on Foata normal form. 322/9273 useless extension candidates. Maximal degree in co-relation 51996. Up to 22435 conditions per place. [2022-12-13 11:42:50,063 INFO L137 encePairwiseOnDemand]: 93/111 looper letters, 124 selfloop transitions, 2 changer transitions 31/174 dead transitions. [2022-12-13 11:42:50,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 753 flow [2022-12-13 11:42:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2022-12-13 11:42:50,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6306306306306306 [2022-12-13 11:42:50,065 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 322 flow. Second operand 3 states and 210 transitions. [2022-12-13 11:42:50,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 174 transitions, 753 flow [2022-12-13 11:42:50,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 174 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:42:50,130 INFO L231 Difference]: Finished difference. Result has 115 places, 120 transitions, 346 flow [2022-12-13 11:42:50,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=115, PETRI_TRANSITIONS=120} [2022-12-13 11:42:50,131 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-12-13 11:42:50,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:50,131 INFO L89 Accepts]: Start accepts. Operand has 115 places, 120 transitions, 346 flow [2022-12-13 11:42:50,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:50,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:50,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 120 transitions, 346 flow [2022-12-13 11:42:50,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 120 transitions, 346 flow [2022-12-13 11:42:50,169 INFO L130 PetriNetUnfolder]: 206/812 cut-off events. [2022-12-13 11:42:50,170 INFO L131 PetriNetUnfolder]: For 18/63 co-relation queries the response was YES. [2022-12-13 11:42:50,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 812 events. 206/812 cut-off events. For 18/63 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6186 event pairs, 30 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 1277. Up to 239 conditions per place. [2022-12-13 11:42:50,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 120 transitions, 346 flow [2022-12-13 11:42:50,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 6554 [2022-12-13 11:42:50,187 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:42:50,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 11:42:50,188 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 120 transitions, 346 flow [2022-12-13 11:42:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 11:42:50,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:50,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:50,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:42:50,189 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 11:42:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1867562723, now seen corresponding path program 1 times [2022-12-13 11:42:50,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:50,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476407039] [2022-12-13 11:42:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:50,233 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 11:42:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:50,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476407039] [2022-12-13 11:42:50,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476407039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:50,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:50,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474655348] [2022-12-13 11:42:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:50,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:50,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:50,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 109 [2022-12-13 11:42:50,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:42:50,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:50,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 109 [2022-12-13 11:42:50,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:52,390 INFO L130 PetriNetUnfolder]: 25696/41988 cut-off events. [2022-12-13 11:42:52,390 INFO L131 PetriNetUnfolder]: For 1477/1665 co-relation queries the response was YES. [2022-12-13 11:42:52,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92497 conditions, 41988 events. 25696/41988 cut-off events. For 1477/1665 co-relation queries the response was YES. Maximal size of possible extension queue 2176. Compared 350138 event pairs, 14289 based on Foata normal form. 51/13541 useless extension candidates. Maximal degree in co-relation 86906. Up to 26597 conditions per place. [2022-12-13 11:42:52,504 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 181 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2022-12-13 11:42:52,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 203 transitions, 961 flow [2022-12-13 11:42:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2022-12-13 11:42:52,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6636085626911316 [2022-12-13 11:42:52,509 INFO L175 Difference]: Start difference. First operand has 113 places, 120 transitions, 346 flow. Second operand 3 states and 217 transitions. [2022-12-13 11:42:52,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 203 transitions, 961 flow [2022-12-13 11:42:52,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 203 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:42:52,515 INFO L231 Difference]: Finished difference. Result has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=115, PETRI_TRANSITIONS=124} [2022-12-13 11:42:52,517 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-12-13 11:42:52,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:52,517 INFO L89 Accepts]: Start accepts. Operand has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:52,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:52,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,565 INFO L130 PetriNetUnfolder]: 296/1146 cut-off events. [2022-12-13 11:42:52,565 INFO L131 PetriNetUnfolder]: For 63/135 co-relation queries the response was YES. [2022-12-13 11:42:52,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 1146 events. 296/1146 cut-off events. For 63/135 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9409 event pairs, 61 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 1859. Up to 358 conditions per place. [2022-12-13 11:42:52,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 7066 [2022-12-13 11:42:52,594 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:42:52,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 11:42:52,595 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 124 transitions, 384 flow [2022-12-13 11:42:52,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:42:52,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:52,596 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:52,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:42:52,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -865740134, now seen corresponding path program 1 times [2022-12-13 11:42:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:52,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585563772] [2022-12-13 11:42:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:52,693 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 11:42:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585563772] [2022-12-13 11:42:52,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585563772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:42:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132220604] [2022-12-13 11:42:52,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:52,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:42:52,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:42:52,696 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 11:42:52,700 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 11:42:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:52,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:42:52,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:42:52,861 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 11:42:52,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:42:52,889 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 11:42:52,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132220604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:42:52,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:42:52,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 11:42:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371990525] [2022-12-13 11:42:52,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:42:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:42:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:42:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:42:52,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 109 [2022-12-13 11:42:52,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 124 transitions, 384 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 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 11:42:52,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:52,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 109 [2022-12-13 11:42:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:56,778 INFO L130 PetriNetUnfolder]: 43919/71308 cut-off events. [2022-12-13 11:42:56,778 INFO L131 PetriNetUnfolder]: For 6546/6546 co-relation queries the response was YES. [2022-12-13 11:42:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166016 conditions, 71308 events. 43919/71308 cut-off events. For 6546/6546 co-relation queries the response was YES. Maximal size of possible extension queue 2978. Compared 584677 event pairs, 11895 based on Foata normal form. 262/24954 useless extension candidates. Maximal degree in co-relation 158519. Up to 23781 conditions per place. [2022-12-13 11:42:57,020 INFO L137 encePairwiseOnDemand]: 94/109 looper letters, 552 selfloop transitions, 70 changer transitions 73/706 dead transitions. [2022-12-13 11:42:57,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 706 transitions, 3527 flow [2022-12-13 11:42:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:42:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 11:42:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 824 transitions. [2022-12-13 11:42:57,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6299694189602446 [2022-12-13 11:42:57,023 INFO L175 Difference]: Start difference. First operand has 115 places, 124 transitions, 384 flow. Second operand 12 states and 824 transitions. [2022-12-13 11:42:57,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 706 transitions, 3527 flow [2022-12-13 11:42:57,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 706 transitions, 3503 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:42:57,062 INFO L231 Difference]: Finished difference. Result has 131 places, 185 transitions, 930 flow [2022-12-13 11:42:57,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=930, PETRI_PLACES=131, PETRI_TRANSITIONS=185} [2022-12-13 11:42:57,063 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-12-13 11:42:57,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:57,063 INFO L89 Accepts]: Start accepts. Operand has 131 places, 185 transitions, 930 flow [2022-12-13 11:42:57,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:57,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:57,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 185 transitions, 930 flow [2022-12-13 11:42:57,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 185 transitions, 930 flow [2022-12-13 11:42:57,278 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([642] L949-1-->L953-2: Formula: (= (+ v_~top~0_106 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_46|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_46|} OutVars{t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_43|, ~top~0=v_~top~0_106} AuxVars[] AssignedVars[t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0][138], [Black: 255#(= ~top~0 0), Black: 257#(<= ~top~0 1), Black: 344#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 348#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 305#(not (<= 800 ~top~0)), 253#true, Black: 242#(= ~top~0 0), 231#true, Black: 247#(= ~flag~0 0), 28#L1023-4true, 198#true, t2Thread1of1ForFork0InUse, Black: 251#(= |t1Thread1of1ForFork1_push_#res#1| 0), Black: 346#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1))]) [2022-12-13 11:42:57,278 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,278 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([643] L949-1-->L947: Formula: (= (+ v_~top~0_108 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_50|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_50|} OutVars{~top~0=v_~top~0_108} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0][142], [Black: 255#(= ~top~0 0), Black: 257#(<= ~top~0 1), Black: 344#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 348#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 305#(not (<= 800 ~top~0)), 224#true, 253#true, Black: 242#(= ~top~0 0), Black: 247#(= ~flag~0 0), 28#L1023-4true, 198#true, t2Thread1of1ForFork0InUse, Black: 251#(= |t1Thread1of1ForFork1_push_#res#1| 0), Black: 346#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1))]) [2022-12-13 11:42:57,279 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L949-1-->L949-2: Formula: (= |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5| (+ 1 v_~top~0_9)) 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_9} AuxVars[] AssignedVars[~top~0][132], [Black: 255#(= ~top~0 0), Black: 257#(<= ~top~0 1), Black: 344#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 348#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 305#(not (<= 800 ~top~0)), 253#true, Black: 242#(= ~top~0 0), 28#L1023-4true, Black: 247#(= ~flag~0 0), 198#true, t2Thread1of1ForFork0InUse, 82#L949-2true, Black: 251#(= |t1Thread1of1ForFork1_push_#res#1| 0), Black: 346#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1))]) [2022-12-13 11:42:57,279 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,279 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:57,280 INFO L385 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 11:42:57,297 INFO L130 PetriNetUnfolder]: 766/3778 cut-off events. [2022-12-13 11:42:57,297 INFO L131 PetriNetUnfolder]: For 1180/1542 co-relation queries the response was YES. [2022-12-13 11:42:57,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 3778 events. 766/3778 cut-off events. For 1180/1542 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 42505 event pairs, 67 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 6966. Up to 767 conditions per place. [2022-12-13 11:42:57,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 185 transitions, 930 flow [2022-12-13 11:42:57,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 9920 [2022-12-13 11:42:57,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [663] L1008-1-->L975-3: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#t~ret35#1_85| |v_t2Thread1of1ForFork0_get_top_#res#1_87|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_87| v_~top~0_143) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_37| |v_t2Thread1of1ForFork0_pop_~stack#1.base_57|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_57| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_37|) (= |v_~#arr~0.offset_52| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_37|) (= |v_t2Thread1of1ForFork0_pop_#t~ret35#1_85| 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_37| |v_~#arr~0.base_55|) (not (= (mod v_~flag~0_67 256) 0))) InVars {~#arr~0.offset=|v_~#arr~0.offset_52|, ~flag~0=v_~flag~0_67, ~top~0=v_~top~0_143, ~#arr~0.base=|v_~#arr~0.base_55|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_52|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_85|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_87|, ~flag~0=v_~flag~0_67, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_37|, ~top~0=v_~top~0_143, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_71|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_57|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_57|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_59|, t2Thread1of1ForFork0_#t~nondet44#1=|v_t2Thread1of1ForFork0_#t~nondet44#1_71|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_37|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_67|, ~#arr~0.base=|v_~#arr~0.base_55|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_37|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_#t~nondet44#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-13 11:42:57,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [665] L1008-1-->pop_returnLabel#1: Formula: (and (not (= (mod v_~flag~0_71 256) 0)) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_59|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_61|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_91| 0) (= |v_~#arr~0.offset_56| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_61| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_75|) 0) (= |v_t2Thread1of1ForFork0_get_top_#res#1_91| v_~top~0_147)) InVars {~#arr~0.offset=|v_~#arr~0.offset_56|, ~flag~0=v_~flag~0_71, ~top~0=v_~top~0_147, ~#arr~0.base=|v_~#arr~0.base_59|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_56|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_93|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_91|, ~flag~0=v_~flag~0_71, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_41|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_75|, ~top~0=v_~top~0_147, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_61|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_61|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_63|, t2Thread1of1ForFork0_#t~nondet44#1=|v_t2Thread1of1ForFork0_#t~nondet44#1_75|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_71|, ~#arr~0.base=|v_~#arr~0.base_59|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_#t~nondet44#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-13 11:42:57,452 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [642] L949-1-->L953-2: Formula: (= (+ v_~top~0_106 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_46|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_46|} OutVars{t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_43|, ~top~0=v_~top~0_106} AuxVars[] AssignedVars[t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 11:42:57,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [643] L949-1-->L947: Formula: (= (+ v_~top~0_108 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_50|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_50|} OutVars{~top~0=v_~top~0_108} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 11:42:57,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [666] L1008-1-->L978: Formula: (and (= |v_~#arr~0.offset_58| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_43|) (not (= (mod v_~flag~0_73 256) 0)) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 0) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_149) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_43| |v_~#arr~0.base_61|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_63| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_43|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_43| |v_t2Thread1of1ForFork0_pop_~stack#1.base_63|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_58|, ~flag~0=v_~flag~0_73, ~top~0=v_~top~0_149, ~#arr~0.base=|v_~#arr~0.base_61|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_58|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_97|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, ~flag~0=v_~flag~0_73, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_45|, ~top~0=v_~top~0_149, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_79|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_63|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_63|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_65|, t2Thread1of1ForFork0_#t~nondet44#1=|v_t2Thread1of1ForFork0_#t~nondet44#1_77|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_43|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_73|, ~#arr~0.base=|v_~#arr~0.base_61|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_43|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_#t~nondet44#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-13 11:42:57,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [664] L1008-1-->L977: Formula: (and (= |v_t2Thread1of1ForFork0_get_top_#res#1_89| v_~top~0_145) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_59| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_89| 0) (= |v_~#arr~0.offset_54| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|) (not (= 0 (mod v_~flag~0_69 256))) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39| |v_t2Thread1of1ForFork0_pop_~stack#1.base_59|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39| |v_~#arr~0.base_57|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_54|, ~flag~0=v_~flag~0_69, ~top~0=v_~top~0_145, ~#arr~0.base=|v_~#arr~0.base_57|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_54|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_89|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_89|, ~flag~0=v_~flag~0_69, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_39|, ~top~0=v_~top~0_145, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_73|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_59|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_59|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_61|, t2Thread1of1ForFork0_#t~nondet44#1=|v_t2Thread1of1ForFork0_#t~nondet44#1_73|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_39|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_69|, ~#arr~0.base=|v_~#arr~0.base_57|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_39|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_#t~nondet44#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-13 11:42:57,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] 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 [450] L949-1-->L949-2: Formula: (= |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5| (+ 1 v_~top~0_9)) 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_9} AuxVars[] AssignedVars[~top~0] [2022-12-13 11:42:57,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:42:57,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-13 11:42:57,595 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 184 transitions, 958 flow [2022-12-13 11:42:57,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 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 11:42:57,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:57,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:57,603 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 11:42:57,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:42:57,801 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 11:42:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -870713872, now seen corresponding path program 1 times [2022-12-13 11:42:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848672335] [2022-12-13 11:42:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:57,885 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 11:42:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:57,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848672335] [2022-12-13 11:42:57,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848672335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:57,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:42:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502570171] [2022-12-13 11:42:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:57,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:57,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:57,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 119 [2022-12-13 11:42:57,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 184 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 11:42:57,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:57,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 119 [2022-12-13 11:42:57,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:59,289 INFO L130 PetriNetUnfolder]: 12098/22317 cut-off events. [2022-12-13 11:42:59,289 INFO L131 PetriNetUnfolder]: For 4354/4354 co-relation queries the response was YES. [2022-12-13 11:42:59,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51787 conditions, 22317 events. 12098/22317 cut-off events. For 4354/4354 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 184097 event pairs, 1774 based on Foata normal form. 417/9073 useless extension candidates. Maximal degree in co-relation 50780. Up to 17786 conditions per place. [2022-12-13 11:42:59,347 INFO L137 encePairwiseOnDemand]: 94/119 looper letters, 58 selfloop transitions, 12 changer transitions 74/163 dead transitions. [2022-12-13 11:42:59,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 163 transitions, 964 flow [2022-12-13 11:42:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-12-13 11:42:59,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.484593837535014 [2022-12-13 11:42:59,348 INFO L175 Difference]: Start difference. First operand has 130 places, 184 transitions, 958 flow. Second operand 3 states and 173 transitions. [2022-12-13 11:42:59,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 163 transitions, 964 flow [2022-12-13 11:42:59,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 944 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-13 11:42:59,381 INFO L231 Difference]: Finished difference. Result has 126 places, 71 transitions, 289 flow [2022-12-13 11:42:59,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=126, PETRI_TRANSITIONS=71} [2022-12-13 11:42:59,382 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 9 predicate places. [2022-12-13 11:42:59,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:59,382 INFO L89 Accepts]: Start accepts. Operand has 126 places, 71 transitions, 289 flow [2022-12-13 11:42:59,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:59,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:59,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 71 transitions, 289 flow [2022-12-13 11:42:59,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 71 transitions, 289 flow [2022-12-13 11:42:59,420 INFO L130 PetriNetUnfolder]: 167/834 cut-off events. [2022-12-13 11:42:59,421 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-13 11:42:59,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 834 events. 167/834 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5984 event pairs, 28 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1511. Up to 181 conditions per place. [2022-12-13 11:42:59,425 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 71 transitions, 289 flow [2022-12-13 11:42:59,425 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 11:43:00,187 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 11:43:00,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 806 [2022-12-13 11:43:00,188 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 289 flow [2022-12-13 11:43:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 11:43:00,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:00,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:00,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:43:00,189 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 11:43:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 592454203, now seen corresponding path program 1 times [2022-12-13 11:43:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:00,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934767445] [2022-12-13 11:43:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:00,255 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 11:43:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934767445] [2022-12-13 11:43:00,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934767445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:00,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:00,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:43:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722195453] [2022-12-13 11:43:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:00,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:00,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:00,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 59 [2022-12-13 11:43:00,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:00,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:00,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 59 [2022-12-13 11:43:00,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:00,685 INFO L130 PetriNetUnfolder]: 4192/7837 cut-off events. [2022-12-13 11:43:00,685 INFO L131 PetriNetUnfolder]: For 2736/2736 co-relation queries the response was YES. [2022-12-13 11:43:00,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19426 conditions, 7837 events. 4192/7837 cut-off events. For 2736/2736 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 53478 event pairs, 1102 based on Foata normal form. 92/4777 useless extension candidates. Maximal degree in co-relation 15536. Up to 2812 conditions per place. [2022-12-13 11:43:00,716 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 110 selfloop transitions, 11 changer transitions 17/149 dead transitions. [2022-12-13 11:43:00,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 149 transitions, 792 flow [2022-12-13 11:43:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:43:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:43:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2022-12-13 11:43:00,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5677966101694916 [2022-12-13 11:43:00,718 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 289 flow. Second operand 6 states and 201 transitions. [2022-12-13 11:43:00,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 149 transitions, 792 flow [2022-12-13 11:43:00,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 149 transitions, 749 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:00,726 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 297 flow [2022-12-13 11:43:00,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2022-12-13 11:43:00,726 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -42 predicate places. [2022-12-13 11:43:00,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:00,727 INFO L89 Accepts]: Start accepts. Operand has 75 places, 64 transitions, 297 flow [2022-12-13 11:43:00,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:00,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:00,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 64 transitions, 297 flow [2022-12-13 11:43:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 64 transitions, 297 flow [2022-12-13 11:43:00,758 INFO L130 PetriNetUnfolder]: 167/782 cut-off events. [2022-12-13 11:43:00,758 INFO L131 PetriNetUnfolder]: For 695/695 co-relation queries the response was YES. [2022-12-13 11:43:00,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 782 events. 167/782 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5592 event pairs, 28 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 1478. Up to 197 conditions per place. [2022-12-13 11:43:00,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 64 transitions, 297 flow [2022-12-13 11:43:00,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 1280 [2022-12-13 11:43:00,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] L945-1-->push_returnLabel#1: Formula: (and (= |v_t1Thread1of1ForFork1_push_#res#1_21| 0) (= (+ 1 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_44|) v_~top~0_84)) InVars {t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_44|} OutVars{~top~0=v_~top~0_84, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_21|} AuxVars[] AssignedVars[~top~0, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_inc_top_#t~post31#1] and [676] L991-6-->L996-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_In_3| |v_~#m~0.base_In_3|)) (.cse1 (mod |v_t1Thread1of1ForFork1_~tmp~0#1_Out_6| 4294967296))) (and (< |v_t1Thread1of1ForFork1_~i~0#1_In_3| 800) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.offset_Out_2| |v_~#arr~0.offset_In_1|) (= |v_t1Thread1of1ForFork1_push_#in~stack#1.base_Out_2| |v_~#arr~0.base_In_1|) (= |v_#pthreadsMutex_Out_6| (store |v_#pthreadsMutex_In_3| |v_~#m~0.base_In_3| (store .cse0 |v_~#m~0.offset_In_3| 1))) (not (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (< .cse1 800) 1 0) |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_t1Thread1of1ForFork1_#t~nondet41#1_In_3| |v_t1Thread1of1ForFork1_~tmp~0#1_Out_6|) (= |v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| |v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse0 |v_~#m~0.offset_In_3|) 0) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork1_push_#in~x#1_Out_2|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_1|, #pthreadsMutex=|v_#pthreadsMutex_In_3|, ~#m~0.base=|v_~#m~0.base_In_3|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_3|, ~#m~0.offset=|v_~#m~0.offset_In_3|, ~#arr~0.base=|v_~#arr~0.base_In_1|, t1Thread1of1ForFork1_#t~nondet41#1=|v_t1Thread1of1ForFork1_#t~nondet41#1_In_3|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_In_1|, #pthreadsMutex=|v_#pthreadsMutex_Out_6|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_3|, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, t1Thread1of1ForFork1_push_#in~stack#1.base=|v_t1Thread1of1ForFork1_push_#in~stack#1.base_Out_2|, t1Thread1of1ForFork1_push_#in~stack#1.offset=|v_t1Thread1of1ForFork1_push_#in~stack#1.offset_Out_2|, t1Thread1of1ForFork1_push_#in~x#1=|v_t1Thread1of1ForFork1_push_#in~x#1_Out_2|, t1Thread1of1ForFork1_push_#res#1=|v_t1Thread1of1ForFork1_push_#res#1_Out_2|, t1Thread1of1ForFork1_#t~nondet40#1=|v_t1Thread1of1ForFork1_#t~nondet40#1_Out_6|, ~#m~0.base=|v_~#m~0.base_In_3|, ~#m~0.offset=|v_~#m~0.offset_In_3|, t1Thread1of1ForFork1_~tmp~0#1=|v_t1Thread1of1ForFork1_~tmp~0#1_Out_6|, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, ~#arr~0.base=|v_~#arr~0.base_In_1|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork1_~tmp~0#1, t1Thread1of1ForFork1_push_#in~stack#1.base, t1Thread1of1ForFork1_push_#in~stack#1.offset, t1Thread1of1ForFork1_push_#in~x#1, t1Thread1of1ForFork1_assume_abort_if_not_~cond#1, t1Thread1of1ForFork1_push_#res#1, t1Thread1of1ForFork1_#t~nondet40#1, t1Thread1of1ForFork1_#t~nondet41#1] [2022-12-13 11:43:01,298 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:43:01,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 572 [2022-12-13 11:43:01,299 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 300 flow [2022-12-13 11:43:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:01,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:01,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:01,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:43:01,300 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 11:43:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash -52293530, now seen corresponding path program 1 times [2022-12-13 11:43:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:01,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348064341] [2022-12-13 11:43:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:01,715 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 11:43:01,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:01,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348064341] [2022-12-13 11:43:01,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348064341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:01,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:01,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688785001] [2022-12-13 11:43:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:43:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:43:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:43:01,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 57 [2022-12-13 11:43:01,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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 11:43:01,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:01,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 57 [2022-12-13 11:43:01,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:02,873 INFO L130 PetriNetUnfolder]: 6944/13111 cut-off events. [2022-12-13 11:43:02,873 INFO L131 PetriNetUnfolder]: For 8635/8635 co-relation queries the response was YES. [2022-12-13 11:43:02,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31830 conditions, 13111 events. 6944/13111 cut-off events. For 8635/8635 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 102119 event pairs, 2323 based on Foata normal form. 0/7507 useless extension candidates. Maximal degree in co-relation 18926. Up to 5925 conditions per place. [2022-12-13 11:43:02,925 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 159 selfloop transitions, 11 changer transitions 10/192 dead transitions. [2022-12-13 11:43:02,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 192 transitions, 1102 flow [2022-12-13 11:43:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:43:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:43:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 248 transitions. [2022-12-13 11:43:02,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6215538847117794 [2022-12-13 11:43:02,926 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 300 flow. Second operand 7 states and 248 transitions. [2022-12-13 11:43:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 192 transitions, 1102 flow [2022-12-13 11:43:02,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 192 transitions, 1075 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 11:43:02,939 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 392 flow [2022-12-13 11:43:02,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2022-12-13 11:43:02,939 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -39 predicate places. [2022-12-13 11:43:02,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:02,940 INFO L89 Accepts]: Start accepts. Operand has 78 places, 72 transitions, 392 flow [2022-12-13 11:43:02,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:02,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:02,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 72 transitions, 392 flow [2022-12-13 11:43:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 72 transitions, 392 flow [2022-12-13 11:43:03,017 INFO L130 PetriNetUnfolder]: 319/1442 cut-off events. [2022-12-13 11:43:03,017 INFO L131 PetriNetUnfolder]: For 1579/1583 co-relation queries the response was YES. [2022-12-13 11:43:03,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1442 events. 319/1442 cut-off events. For 1579/1583 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12392 event pairs, 28 based on Foata normal form. 4/801 useless extension candidates. Maximal degree in co-relation 2555. Up to 401 conditions per place. [2022-12-13 11:43:03,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 72 transitions, 392 flow [2022-12-13 11:43:03,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 1448 [2022-12-13 11:43:03,789 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:43:03,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 849 [2022-12-13 11:43:03,790 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 400 flow [2022-12-13 11:43:03,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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 11:43:03,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:03,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:03,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:43:03,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 935176608, now seen corresponding path program 1 times [2022-12-13 11:43:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625973896] [2022-12-13 11:43:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:04,127 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 11:43:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:04,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625973896] [2022-12-13 11:43:04,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625973896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:04,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:43:04,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031296785] [2022-12-13 11:43:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:04,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:43:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:04,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:43:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:43:04,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 59 [2022-12-13 11:43:04,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:04,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:04,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 59 [2022-12-13 11:43:04,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:05,259 INFO L130 PetriNetUnfolder]: 8976/16858 cut-off events. [2022-12-13 11:43:05,259 INFO L131 PetriNetUnfolder]: For 15745/15763 co-relation queries the response was YES. [2022-12-13 11:43:05,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42953 conditions, 16858 events. 8976/16858 cut-off events. For 15745/15763 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 136840 event pairs, 2302 based on Foata normal form. 46/10444 useless extension candidates. Maximal degree in co-relation 29729. Up to 5252 conditions per place. [2022-12-13 11:43:05,347 INFO L137 encePairwiseOnDemand]: 47/59 looper letters, 145 selfloop transitions, 16 changer transitions 6/179 dead transitions. [2022-12-13 11:43:05,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 179 transitions, 1159 flow [2022-12-13 11:43:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:43:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:43:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2022-12-13 11:43:05,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6242937853107344 [2022-12-13 11:43:05,349 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 400 flow. Second operand 6 states and 221 transitions. [2022-12-13 11:43:05,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 179 transitions, 1159 flow [2022-12-13 11:43:05,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 179 transitions, 1155 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 11:43:05,369 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 533 flow [2022-12-13 11:43:05,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2022-12-13 11:43:05,370 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -33 predicate places. [2022-12-13 11:43:05,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:05,370 INFO L89 Accepts]: Start accepts. Operand has 84 places, 77 transitions, 533 flow [2022-12-13 11:43:05,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:05,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:05,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 77 transitions, 533 flow [2022-12-13 11:43:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 533 flow [2022-12-13 11:43:05,461 INFO L130 PetriNetUnfolder]: 430/1884 cut-off events. [2022-12-13 11:43:05,461 INFO L131 PetriNetUnfolder]: For 3697/3701 co-relation queries the response was YES. [2022-12-13 11:43:05,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4277 conditions, 1884 events. 430/1884 cut-off events. For 3697/3701 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17144 event pairs, 25 based on Foata normal form. 4/1099 useless extension candidates. Maximal degree in co-relation 2805. Up to 561 conditions per place. [2022-12-13 11:43:05,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 77 transitions, 533 flow [2022-12-13 11:43:05,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 1528 [2022-12-13 11:43:05,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:05,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 11:43:05,474 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 533 flow [2022-12-13 11:43:05,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:05,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:05,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:05,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:43:05,475 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 11:43:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1780049353, now seen corresponding path program 1 times [2022-12-13 11:43:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:05,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722455000] [2022-12-13 11:43:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:43:05,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:43:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:43:05,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:43:05,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:43:05,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:43:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-13 11:43:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:43:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-13 11:43:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-13 11:43:05,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:43:05,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:43:05,538 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:05,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:43:05,541 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:43:05,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:43:05 BasicIcfg [2022-12-13 11:43:05,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:43:05,594 INFO L158 Benchmark]: Toolchain (without parser) took 25319.27ms. Allocated memory was 208.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 184.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 11:43:05,594 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 208.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:43:05,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 208.7MB. Free memory was 183.5MB in the beginning and 154.1MB in the end (delta: 29.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:43:05,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.54ms. Allocated memory is still 208.7MB. Free memory was 154.1MB in the beginning and 151.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:43:05,594 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 208.7MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:43:05,594 INFO L158 Benchmark]: RCFGBuilder took 431.88ms. Allocated memory is still 208.7MB. Free memory was 149.4MB in the beginning and 131.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 11:43:05,595 INFO L158 Benchmark]: TraceAbstraction took 24256.84ms. Allocated memory was 208.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 130.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 11:43:05,595 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 208.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 208.7MB. Free memory was 183.5MB in the beginning and 154.1MB in the end (delta: 29.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.54ms. Allocated memory is still 208.7MB. Free memory was 154.1MB in the beginning and 151.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 208.7MB. Free memory was 151.5MB in the beginning and 149.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 431.88ms. Allocated memory is still 208.7MB. Free memory was 149.4MB in the beginning and 131.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24256.84ms. Allocated memory was 208.7MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 130.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 143 PlacesBefore, 117 PlacesAfterwards, 146 TransitionsBefore, 115 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 83 ConcurrentYvCompositions, 12 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14564, independent: 14297, independent conditional: 14297, independent unconditional: 0, dependent: 267, dependent conditional: 267, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14564, independent: 14297, independent conditional: 0, independent unconditional: 14297, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14564, independent: 14297, independent conditional: 0, independent unconditional: 14297, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14564, independent: 14297, independent conditional: 0, independent unconditional: 14297, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7389, independent: 7317, independent conditional: 0, independent unconditional: 7317, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7389, independent: 7300, independent conditional: 0, independent unconditional: 7300, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14564, independent: 6980, independent conditional: 0, independent unconditional: 6980, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 7389, unknown conditional: 0, unknown unconditional: 7389] , Statistics on independence cache: Total cache size (in pairs): 19111, Positive cache size: 19039, Positive conditional cache size: 0, Positive unconditional cache size: 19039, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 114 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 6968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2242, independent: 2184, independent conditional: 2184, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2242, independent: 2184, independent conditional: 59, independent unconditional: 2125, dependent: 58, dependent conditional: 15, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2242, independent: 2184, independent conditional: 2, independent unconditional: 2182, dependent: 58, dependent conditional: 15, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2242, independent: 2184, independent conditional: 2, independent unconditional: 2182, dependent: 58, dependent conditional: 15, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1130, independent: 1096, independent conditional: 2, independent unconditional: 1094, dependent: 34, dependent conditional: 11, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1130, independent: 1076, independent conditional: 0, independent unconditional: 1076, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 34, dependent conditional: 11, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 46, dependent conditional: 14, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2242, independent: 1088, independent conditional: 0, independent unconditional: 1088, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 1130, unknown conditional: 13, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1130, Positive cache size: 1096, Positive conditional cache size: 2, Positive unconditional cache size: 1094, Negative cache size: 34, Negative conditional cache size: 11, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 6554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 936, independent: 910, independent conditional: 910, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 936, independent: 910, independent conditional: 0, independent unconditional: 910, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 936, independent: 910, independent conditional: 0, independent unconditional: 910, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 936, independent: 910, independent conditional: 0, independent unconditional: 910, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 936, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 45, unknown conditional: 0, unknown unconditional: 45] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1135, Positive conditional cache size: 2, Positive unconditional cache size: 1133, Negative cache size: 40, Negative conditional cache size: 11, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 7066 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 832, independent: 810, independent conditional: 810, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 832, independent: 810, independent conditional: 32, independent unconditional: 778, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 832, independent: 810, independent conditional: 0, independent unconditional: 810, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 832, independent: 810, independent conditional: 0, independent unconditional: 810, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 832, independent: 810, independent conditional: 0, independent unconditional: 810, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1179, Positive cache size: 1135, Positive conditional cache size: 2, Positive unconditional cache size: 1133, Negative cache size: 44, Negative conditional cache size: 11, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 131 PlacesBefore, 130 PlacesAfterwards, 185 TransitionsBefore, 184 TransitionsAfterwards, 9920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1034, independent: 987, independent conditional: 987, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1034, independent: 987, independent conditional: 584, independent unconditional: 403, dependent: 47, dependent conditional: 33, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1034, independent: 987, independent conditional: 548, independent unconditional: 439, dependent: 47, dependent conditional: 33, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1034, independent: 987, independent conditional: 548, independent unconditional: 439, dependent: 47, dependent conditional: 33, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 99, independent: 91, independent conditional: 52, independent unconditional: 39, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 99, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1034, independent: 896, independent conditional: 496, independent unconditional: 400, dependent: 39, dependent conditional: 25, dependent unconditional: 14, unknown: 99, unknown conditional: 60, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1247, Positive conditional cache size: 54, Positive unconditional cache size: 1193, Negative cache size: 52, Negative conditional cache size: 19, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 73 PlacesBefore, 68 PlacesAfterwards, 71 TransitionsBefore, 66 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 60, independent unconditional: 138, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 198, independent conditional: 40, independent unconditional: 158, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 40, independent unconditional: 158, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 40, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 59, unknown conditional: 40, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1456, Positive conditional cache size: 94, Positive unconditional cache size: 1362, Negative cache size: 52, Negative conditional cache size: 19, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 72 PlacesBefore, 71 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 1280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 16, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 1551, Positive cache size: 1499, Positive conditional cache size: 94, Positive unconditional cache size: 1405, Negative cache size: 52, Negative conditional cache size: 19, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 77 PlacesBefore, 76 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 1448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 100, independent conditional: 16, independent unconditional: 84, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1592, Positive cache size: 1540, Positive conditional cache size: 94, Positive unconditional cache size: 1446, Negative cache size: 52, Negative conditional cache size: 19, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1592, Positive cache size: 1540, Positive conditional cache size: 94, Positive unconditional cache size: 1446, Negative cache size: 52, Negative conditional cache size: 19, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, stack={3:0}, top=1, x=0] [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); VAL [\result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, stack={3:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1453 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1453 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2940 IncrementalHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 7 mSDtfsCounter, 2940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=958occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 942 SizeOfPredicates, 1 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:43:05,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...