/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/weaver/chl-chromosome-opt-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:13:41,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:13:41,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:13:41,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:13:41,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:13:41,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:13:41,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:13:41,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:13:41,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:13:41,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:13:41,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:13:41,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:13:41,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:13:41,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:13:41,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:13:41,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:13:41,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:13:41,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:13:41,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:13:41,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:13:41,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:13:41,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:13:41,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:13:41,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:13:41,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:13:41,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:13:41,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:13:41,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:13:41,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:13:41,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:13:41,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:13:41,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:13:41,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:13:41,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:13:41,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:13:41,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:13:41,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:13:41,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:13:41,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:13:41,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:13:41,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:13:41,752 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-06 07:13:41,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:13:41,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:13:41,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:13:41,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:13:41,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:13:41,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:13:41,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:13:41,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:13:41,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:13:41,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:13:41,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:13:41,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:13:41,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:13:41,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:13:42,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:13:42,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:13:42,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:13:42,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:13:42,117 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:13:42,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2022-12-06 07:13:43,083 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:13:43,272 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:13:43,273 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2022-12-06 07:13:43,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86052757c/9a7d848a03d745b88f35eb9fdc76cdf9/FLAG3ddf8d986 [2022-12-06 07:13:43,295 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86052757c/9a7d848a03d745b88f35eb9fdc76cdf9 [2022-12-06 07:13:43,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:13:43,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:13:43,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:13:43,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:13:43,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:13:43,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3486f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43, skipping insertion in model container [2022-12-06 07:13:43,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:13:43,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:13:43,474 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-12-06 07:13:43,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:13:43,491 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:13:43,519 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2566,2579] [2022-12-06 07:13:43,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:13:43,531 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:13:43,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43 WrapperNode [2022-12-06 07:13:43,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:13:43,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:13:43,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:13:43,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:13:43,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,578 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 174 [2022-12-06 07:13:43,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:13:43,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:13:43,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:13:43,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:13:43,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:13:43,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:13:43,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:13:43,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:13:43,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (1/1) ... [2022-12-06 07:13:43,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:13:43,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:43,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:13:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:13:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:13:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:13:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:13:43,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:13:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:13:43,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:13:43,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:13:43,672 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:13:43,755 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:13:43,756 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:13:43,979 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:13:43,990 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:13:43,990 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:13:43,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:13:43 BoogieIcfgContainer [2022-12-06 07:13:43,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:13:44,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:13:44,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:13:44,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:13:44,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:13:43" (1/3) ... [2022-12-06 07:13:44,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1502dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:13:44, skipping insertion in model container [2022-12-06 07:13:44,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:13:43" (2/3) ... [2022-12-06 07:13:44,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1502dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:13:44, skipping insertion in model container [2022-12-06 07:13:44,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:13:43" (3/3) ... [2022-12-06 07:13:44,006 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2022-12-06 07:13:44,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:13:44,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:13:44,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:13:44,106 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:13:44,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 195 transitions, 406 flow [2022-12-06 07:13:44,255 INFO L130 PetriNetUnfolder]: 19/193 cut-off events. [2022-12-06 07:13:44,255 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:13:44,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 19/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 215 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 136. Up to 3 conditions per place. [2022-12-06 07:13:44,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 195 transitions, 406 flow [2022-12-06 07:13:44,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 185 transitions, 382 flow [2022-12-06 07:13:44,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:44,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 185 transitions, 382 flow [2022-12-06 07:13:44,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 185 transitions, 382 flow [2022-12-06 07:13:44,343 INFO L130 PetriNetUnfolder]: 19/185 cut-off events. [2022-12-06 07:13:44,344 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:13:44,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 185 events. 19/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 215 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 136. Up to 3 conditions per place. [2022-12-06 07:13:44,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 185 transitions, 382 flow [2022-12-06 07:13:44,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 3332 [2022-12-06 07:13:49,514 INFO L203 LiptonReduction]: Total number of compositions: 160 [2022-12-06 07:13:49,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:13:49,531 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;@7e19df1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:13:49,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:13:49,535 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-06 07:13:49,535 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:13:49,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:49,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:49,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1037354139, now seen corresponding path program 1 times [2022-12-06 07:13:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684070102] [2022-12-06 07:13:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684070102] [2022-12-06 07:13:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684070102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:49,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:49,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:13:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140840205] [2022-12-06 07:13:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:13:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:49,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:13:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:13:49,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:13:49,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:49,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:49,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:13:49,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:49,900 INFO L130 PetriNetUnfolder]: 91/158 cut-off events. [2022-12-06 07:13:49,900 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:13:49,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 158 events. 91/158 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 403 event pairs, 51 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 278. Up to 151 conditions per place. [2022-12-06 07:13:49,902 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 22 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2022-12-06 07:13:49,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 118 flow [2022-12-06 07:13:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:13:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:13:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 07:13:49,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2022-12-06 07:13:49,914 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 3 states and 31 transitions. [2022-12-06 07:13:49,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 118 flow [2022-12-06 07:13:49,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:13:49,918 INFO L231 Difference]: Finished difference. Result has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=27} [2022-12-06 07:13:49,922 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-06 07:13:49,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:49,923 INFO L89 Accepts]: Start accepts. Operand has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:49,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:49,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,931 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 07:13:49,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:13:49,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 27 events. 6/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2022-12-06 07:13:49,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:13:49,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:49,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:13:49,944 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 27 transitions, 76 flow [2022-12-06 07:13:49,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:49,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:49,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:49,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:13:49,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1383105849, now seen corresponding path program 1 times [2022-12-06 07:13:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:49,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037938017] [2022-12-06 07:13:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:13:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037938017] [2022-12-06 07:13:50,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037938017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603289533] [2022-12-06 07:13:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:50,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:50,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:50,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:13:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:50,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:13:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:13:50,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:13:50,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603289533] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:13:50,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:13:50,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 07:13:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871277596] [2022-12-06 07:13:50,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:13:50,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:13:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:13:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:13:50,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:13:50,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 27 transitions, 76 flow. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:50,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:50,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:13:50,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:50,421 INFO L130 PetriNetUnfolder]: 91/164 cut-off events. [2022-12-06 07:13:50,421 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:13:50,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 164 events. 91/164 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 400 event pairs, 51 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 318. Up to 151 conditions per place. [2022-12-06 07:13:50,422 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 22 selfloop transitions, 10 changer transitions 0/33 dead transitions. [2022-12-06 07:13:50,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 164 flow [2022-12-06 07:13:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:13:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:13:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 07:13:50,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2022-12-06 07:13:50,424 INFO L175 Difference]: Start difference. First operand has 25 places, 27 transitions, 76 flow. Second operand 6 states and 44 transitions. [2022-12-06 07:13:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 164 flow [2022-12-06 07:13:50,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:50,425 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-06 07:13:50,426 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-06 07:13:50,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:50,426 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:50,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:50,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,431 INFO L130 PetriNetUnfolder]: 6/33 cut-off events. [2022-12-06 07:13:50,431 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:13:50,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 33 events. 6/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 12 conditions per place. [2022-12-06 07:13:50,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:13:50,432 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:50,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:13:50,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 138 flow [2022-12-06 07:13:50,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:50,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:50,433 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:50,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:13:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:50,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:50,635 INFO L85 PathProgramCache]: Analyzing trace with hash 263123979, now seen corresponding path program 2 times [2022-12-06 07:13:50,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:50,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251837261] [2022-12-06 07:13:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:13:50,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251837261] [2022-12-06 07:13:50,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251837261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:50,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838881826] [2022-12-06 07:13:50,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:13:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:50,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:13:50,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:13:50,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:13:50,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:13:50,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 07:13:50,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:13:50,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838881826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:50,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:13:50,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-12-06 07:13:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145087402] [2022-12-06 07:13:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:50,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:13:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:13:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:13:50,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:13:50,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:50,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:50,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:13:50,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:50,986 INFO L130 PetriNetUnfolder]: 195/342 cut-off events. [2022-12-06 07:13:50,986 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:13:50,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 342 events. 195/342 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1135 event pairs, 60 based on Foata normal form. 4/263 useless extension candidates. Maximal degree in co-relation 679. Up to 166 conditions per place. [2022-12-06 07:13:50,988 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 53 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2022-12-06 07:13:50,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 318 flow [2022-12-06 07:13:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:13:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:13:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-06 07:13:50,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.424 [2022-12-06 07:13:50,989 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 138 flow. Second operand 5 states and 53 transitions. [2022-12-06 07:13:50,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 318 flow [2022-12-06 07:13:50,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 302 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:50,991 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 146 flow [2022-12-06 07:13:50,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2022-12-06 07:13:50,992 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 07:13:50,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:50,992 INFO L89 Accepts]: Start accepts. Operand has 37 places, 35 transitions, 146 flow [2022-12-06 07:13:50,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:50,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:50,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 35 transitions, 146 flow [2022-12-06 07:13:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 146 flow [2022-12-06 07:13:50,997 INFO L130 PetriNetUnfolder]: 7/52 cut-off events. [2022-12-06 07:13:50,997 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 07:13:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 52 events. 7/52 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2022-12-06 07:13:50,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 146 flow [2022-12-06 07:13:50,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 07:13:51,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:13:51,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:13:51,079 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 147 flow [2022-12-06 07:13:51,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:51,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:51,080 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:51,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:13:51,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 07:13:51,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -926459100, now seen corresponding path program 1 times [2022-12-06 07:13:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:51,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328602864] [2022-12-06 07:13:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:13:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:51,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328602864] [2022-12-06 07:13:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328602864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167016558] [2022-12-06 07:13:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:51,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:51,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:13:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:51,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:13:51,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:13:51,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 07:13:51,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167016558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:13:51,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:13:51,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 07:13:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416432128] [2022-12-06 07:13:51,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:13:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:13:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:51,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:13:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:13:51,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:13:51,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 147 flow. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:51,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:51,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:13:51,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:51,754 INFO L130 PetriNetUnfolder]: 173/320 cut-off events. [2022-12-06 07:13:51,754 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 07:13:51,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 320 events. 173/320 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1046 event pairs, 109 based on Foata normal form. 1/272 useless extension candidates. Maximal degree in co-relation 698. Up to 297 conditions per place. [2022-12-06 07:13:51,757 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 24 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2022-12-06 07:13:51,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 231 flow [2022-12-06 07:13:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:13:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:13:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-06 07:13:51,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24175824175824176 [2022-12-06 07:13:51,759 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 147 flow. Second operand 7 states and 44 transitions. [2022-12-06 07:13:51,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 231 flow [2022-12-06 07:13:51,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 222 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:13:51,764 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 07:13:51,765 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2022-12-06 07:13:51,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:51,765 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:51,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:51,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,771 INFO L130 PetriNetUnfolder]: 7/54 cut-off events. [2022-12-06 07:13:51,771 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:13:51,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 54 events. 7/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 92. Up to 8 conditions per place. [2022-12-06 07:13:51,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 07:13:51,774 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:51,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:13:51,775 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 184 flow [2022-12-06 07:13:51,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:51,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:51,775 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:51,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:13:51,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:51,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1809985860, now seen corresponding path program 2 times [2022-12-06 07:13:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:51,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999604002] [2022-12-06 07:13:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:13:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:52,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999604002] [2022-12-06 07:13:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999604002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:52,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:52,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:13:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857095771] [2022-12-06 07:13:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:13:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:13:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:13:52,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:13:52,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:52,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:52,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:13:52,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:52,151 INFO L130 PetriNetUnfolder]: 163/298 cut-off events. [2022-12-06 07:13:52,152 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 07:13:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 298 events. 163/298 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 920 event pairs, 46 based on Foata normal form. 4/260 useless extension candidates. Maximal degree in co-relation 641. Up to 251 conditions per place. [2022-12-06 07:13:52,153 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 39 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2022-12-06 07:13:52,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 294 flow [2022-12-06 07:13:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:13:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:13:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:13:52,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2022-12-06 07:13:52,154 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 184 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:13:52,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 294 flow [2022-12-06 07:13:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 270 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 07:13:52,156 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 172 flow [2022-12-06 07:13:52,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-06 07:13:52,156 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2022-12-06 07:13:52,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:52,156 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 172 flow [2022-12-06 07:13:52,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:52,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:52,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 172 flow [2022-12-06 07:13:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 172 flow [2022-12-06 07:13:52,176 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-06 07:13:52,176 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:13:52,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 54 events. 11/54 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 1 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2022-12-06 07:13:52,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 172 flow [2022-12-06 07:13:52,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 07:13:52,177 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:52,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:13:52,178 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 172 flow [2022-12-06 07:13:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:52,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:52,191 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:13:52,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 806765234, now seen corresponding path program 1 times [2022-12-06 07:13:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454682244] [2022-12-06 07:13:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 07:13:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454682244] [2022-12-06 07:13:52,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454682244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:52,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:53,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:13:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659784677] [2022-12-06 07:13:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:13:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:13:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:13:53,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:13:53,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 172 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:53,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:53,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:13:53,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:53,385 INFO L130 PetriNetUnfolder]: 258/452 cut-off events. [2022-12-06 07:13:53,386 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-06 07:13:53,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 452 events. 258/452 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1637 event pairs, 86 based on Foata normal form. 9/394 useless extension candidates. Maximal degree in co-relation 1057. Up to 186 conditions per place. [2022-12-06 07:13:53,389 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 70 selfloop transitions, 12 changer transitions 10/92 dead transitions. [2022-12-06 07:13:53,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 500 flow [2022-12-06 07:13:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:13:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:13:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 07:13:53,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36444444444444446 [2022-12-06 07:13:53,391 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 172 flow. Second operand 9 states and 82 transitions. [2022-12-06 07:13:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 500 flow [2022-12-06 07:13:53,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 486 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:53,393 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 253 flow [2022-12-06 07:13:53,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-06 07:13:53,394 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2022-12-06 07:13:53,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:53,394 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 253 flow [2022-12-06 07:13:53,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:53,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:53,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 253 flow [2022-12-06 07:13:53,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 253 flow [2022-12-06 07:13:53,419 INFO L130 PetriNetUnfolder]: 27/109 cut-off events. [2022-12-06 07:13:53,420 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 07:13:53,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 109 events. 27/109 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 354 event pairs, 1 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 243. Up to 17 conditions per place. [2022-12-06 07:13:53,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 253 flow [2022-12-06 07:13:53,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:13:53,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [672] L51-9-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (not (= |v_thread1Thread1of1ForFork1_~comp~0#1_27| 0)) (= |v_thread1Thread1of1ForFork1_~comp~0#1_27| v_~res1~0_20)) InVars {thread1Thread1of1ForFork1_~comp~0#1=|v_thread1Thread1of1ForFork1_~comp~0#1_27|} OutVars{~res1~0=v_~res1~0_20, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_27|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_27|, thread1Thread1of1ForFork1_~comp~0#1=|v_thread1Thread1of1ForFork1_~comp~0#1_27|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_27|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_21|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_27|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1] and [667] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre19#1_27|)) |v_#memory_int_119|) (= |v_ULTIMATE.start_main_#t~pre19#1_27| |v_#pthreadsForks_42|)) InVars {#pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{#pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_27|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:13:53,466 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:13:53,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [623] L51-1-->L51-9: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~mem2#1_25| (select (select |v_#memory_int_93| v_~scoreB~0.base_35) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_47| 4) v_~scoreB~0.offset_35))) (< |v_thread1Thread1of1ForFork1_#t~mem1#1_25| |v_thread1Thread1of1ForFork1_#t~mem2#1_25|) (= |v_thread1Thread1of1ForFork1_~comp~0#1_25| |v_thread1Thread1of1ForFork1_#t~ite5#1_25|) (= (+ |v_thread1Thread1of1ForFork1_#t~ite5#1_25| 1) 0)) InVars {~scoreB~0.offset=v_~scoreB~0.offset_35, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, #memory_int=|v_#memory_int_93|, ~scoreB~0.base=v_~scoreB~0.base_35, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_25|} OutVars{~scoreB~0.offset=v_~scoreB~0.offset_35, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_25|, #memory_int=|v_#memory_int_93|, thread1Thread1of1ForFork1_~comp~0#1=|v_thread1Thread1of1ForFork1_~comp~0#1_25|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_25|, ~scoreB~0.base=v_~scoreB~0.base_35, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_~comp~0#1, thread1Thread1of1ForFork1_#t~mem2#1] and [667] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t2~0#1.base_37| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) |v_ULTIMATE.start_main_~#t2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre19#1_27|)) |v_#memory_int_119|) (= |v_ULTIMATE.start_main_#t~pre19#1_27| |v_#pthreadsForks_42|)) InVars {#pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_120|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} OutVars{#pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_5|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_27|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:13:53,585 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:13:53,586 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:13:53,586 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 251 flow [2022-12-06 07:13:53,587 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:53,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:13:53,587 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:13:53,590 INFO L158 Benchmark]: Toolchain (without parser) took 10291.94ms. Allocated memory was 191.9MB in the beginning and 276.8MB in the end (delta: 84.9MB). Free memory was 167.4MB in the beginning and 225.8MB in the end (delta: -58.4MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,590 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:13:53,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.98ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 155.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.31ms. Allocated memory is still 191.9MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,590 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 191.9MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,590 INFO L158 Benchmark]: RCFGBuilder took 386.98ms. Allocated memory is still 191.9MB. Free memory was 151.7MB in the beginning and 133.9MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,591 INFO L158 Benchmark]: TraceAbstraction took 9587.64ms. Allocated memory was 191.9MB in the beginning and 276.8MB in the end (delta: 84.9MB). Free memory was 168.9MB in the beginning and 225.8MB in the end (delta: -56.9MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. [2022-12-06 07:13:53,591 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.09ms. Allocated memory is still 127.9MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.98ms. Allocated memory is still 191.9MB. Free memory was 167.0MB in the beginning and 155.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.31ms. Allocated memory is still 191.9MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 191.9MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 386.98ms. Allocated memory is still 191.9MB. Free memory was 151.7MB in the beginning and 133.9MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9587.64ms. Allocated memory was 191.9MB in the beginning and 276.8MB in the end (delta: 84.9MB). Free memory was 168.9MB in the beginning and 225.8MB in the end (delta: -56.9MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 173 PlacesBefore, 26 PlacesAfterwards, 185 TransitionsBefore, 25 TransitionsAfterwards, 3332 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 90 TrivialYvCompositions, 57 ConcurrentYvCompositions, 13 ChoiceCompositions, 160 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2188, independent: 2162, independent conditional: 2162, 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: 2188, independent: 2162, independent conditional: 0, independent unconditional: 2162, 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: 2188, independent: 2162, independent conditional: 0, independent unconditional: 2162, 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: 2188, independent: 2162, independent conditional: 0, independent unconditional: 2162, 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: 1838, independent: 1824, independent conditional: 0, independent unconditional: 1824, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1838, independent: 1824, independent conditional: 0, independent unconditional: 1824, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2188, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1838, unknown conditional: 0, unknown unconditional: 1838] , Statistics on independence cache: Total cache size (in pairs): 3517, Positive cache size: 3503, Positive conditional cache size: 0, Positive unconditional cache size: 3503, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 25 PlacesBefore, 25 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 48, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 102, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 22, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 50, Positive conditional cache size: 9, Positive unconditional cache size: 41, Negative cache size: 11, Negative conditional cache size: 4, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:13:53,612 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...