/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-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:12:26,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:12:26,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:12:26,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:12:26,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:12:26,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:12:26,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:12:26,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:12:26,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:12:26,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:12:26,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:12:26,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:12:26,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:12:26,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:12:26,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:12:26,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:12:26,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:12:26,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:12:26,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:12:26,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:12:26,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:12:26,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:12:26,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:12:26,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:12:26,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:12:26,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:12:26,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:12:26,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:12:26,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:12:26,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:12:26,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:12:26,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:12:26,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:12:26,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:12:26,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:12:26,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:12:26,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:12:26,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:12:26,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:12:26,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:12:26,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:12:26,116 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:12:26,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:12:26,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:12:26,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:12:26,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:12:26,150 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:12:26,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:12:26,150 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:12:26,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:12:26,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:12:26,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:12:26,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:12:26,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:12:26,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:12:26,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:12:26,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:12:26,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:12:26,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:12:26,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:12:26,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:12:26,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:12:26,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:12:26,153 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:12:26,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:12:26,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:12:26,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:12:26,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:12:26,411 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:12:26,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-12-06 07:12:27,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:12:27,614 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:12:27,615 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-12-06 07:12:27,620 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a880be5bb/e0cb62afb0a847469686389d17966e1e/FLAG31043c7fa [2022-12-06 07:12:27,633 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a880be5bb/e0cb62afb0a847469686389d17966e1e [2022-12-06 07:12:27,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:12:27,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:12:27,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:12:27,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:12:27,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:12:27,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf9a732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27, skipping insertion in model container [2022-12-06 07:12:27,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:12:27,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:12:27,778 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-array-int-symm.wvr.c[2482,2495] [2022-12-06 07:12:27,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:12:27,800 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:12:27,827 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-array-int-symm.wvr.c[2482,2495] [2022-12-06 07:12:27,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:12:27,849 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:12:27,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27 WrapperNode [2022-12-06 07:12:27,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:12:27,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:12:27,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:12:27,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:12:27,854 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:12:27" (1/1) ... [2022-12-06 07:12:27,869 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:12:27" (1/1) ... [2022-12-06 07:12:27,895 INFO L138 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 198 [2022-12-06 07:12:27,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:12:27,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:12:27,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:12:27,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:12:27,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:12:27,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:12:27,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:12:27,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:12:27,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (1/1) ... [2022-12-06 07:12:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:12:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:28,002 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:12:28,038 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:12:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:12:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:12:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:12:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:12:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:12:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:12:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:12:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:12:28,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:12:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:12:28,088 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:12:28,181 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:12:28,183 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:12:28,481 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:12:28,488 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:12:28,488 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:12:28,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:12:28 BoogieIcfgContainer [2022-12-06 07:12:28,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:12:28,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:12:28,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:12:28,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:12:28,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:12:27" (1/3) ... [2022-12-06 07:12:28,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde31b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:12:28, skipping insertion in model container [2022-12-06 07:12:28,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:12:27" (2/3) ... [2022-12-06 07:12:28,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde31b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:12:28, skipping insertion in model container [2022-12-06 07:12:28,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:12:28" (3/3) ... [2022-12-06 07:12:28,494 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2022-12-06 07:12:28,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:12:28,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:12:28,512 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:12:28,628 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:12:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 07:12:28,742 INFO L130 PetriNetUnfolder]: 21/225 cut-off events. [2022-12-06 07:12:28,742 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:12:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 21/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 305 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-12-06 07:12:28,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 227 transitions, 470 flow [2022-12-06 07:12:28,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 446 flow [2022-12-06 07:12:28,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:28,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 07:12:28,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 446 flow [2022-12-06 07:12:28,822 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-06 07:12:28,822 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:12:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 302 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-12-06 07:12:28,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-06 07:12:28,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 5192 [2022-12-06 07:12:35,556 INFO L203 LiptonReduction]: Total number of compositions: 194 [2022-12-06 07:12:35,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:12:35,586 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;@5cdcaeff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:12:35,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:12:35,591 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 07:12:35,591 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:12:35,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:35,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:35,593 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:12:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1634974350, now seen corresponding path program 1 times [2022-12-06 07:12:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:35,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577605166] [2022-12-06 07:12:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:36,271 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:12:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:36,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577605166] [2022-12-06 07:12:36,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577605166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:36,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:36,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:12:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929257094] [2022-12-06 07:12:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:36,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:12:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:12:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:12:36,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:12:36,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:36,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:36,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:12:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:36,651 INFO L130 PetriNetUnfolder]: 156/289 cut-off events. [2022-12-06 07:12:36,652 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 07:12:36,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 289 events. 156/289 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 990 event pairs, 35 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 256. Up to 134 conditions per place. [2022-12-06 07:12:36,657 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 52 selfloop transitions, 11 changer transitions 7/70 dead transitions. [2022-12-06 07:12:36,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 70 transitions, 322 flow [2022-12-06 07:12:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:12:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:12:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-12-06 07:12:36,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3526570048309179 [2022-12-06 07:12:36,668 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 9 states and 73 transitions. [2022-12-06 07:12:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 70 transitions, 322 flow [2022-12-06 07:12:36,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 70 transitions, 294 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:12:36,672 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 126 flow [2022-12-06 07:12:36,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2022-12-06 07:12:36,676 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2022-12-06 07:12:36,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:36,677 INFO L89 Accepts]: Start accepts. Operand has 34 places, 33 transitions, 126 flow [2022-12-06 07:12:36,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:36,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:36,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 126 flow [2022-12-06 07:12:36,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 126 flow [2022-12-06 07:12:36,695 INFO L130 PetriNetUnfolder]: 11/59 cut-off events. [2022-12-06 07:12:36,695 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:12:36,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 59 events. 11/59 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 166 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 80. Up to 6 conditions per place. [2022-12-06 07:12:36,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 33 transitions, 126 flow [2022-12-06 07:12:36,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 07:12:40,995 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:40,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4322 [2022-12-06 07:12:40,998 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 122 flow [2022-12-06 07:12:40,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:40,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:40,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:40,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:12:41,004 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:12:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 780240850, now seen corresponding path program 1 times [2022-12-06 07:12:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:41,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151559240] [2022-12-06 07:12:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:41,300 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:12:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151559240] [2022-12-06 07:12:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151559240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:41,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:41,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:12:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080223359] [2022-12-06 07:12:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:41,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:12:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:12:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:12:41,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:12:41,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 122 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:41,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:41,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:12:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:41,690 INFO L130 PetriNetUnfolder]: 353/641 cut-off events. [2022-12-06 07:12:41,690 INFO L131 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-12-06 07:12:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 641 events. 353/641 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2759 event pairs, 155 based on Foata normal form. 13/578 useless extension candidates. Maximal degree in co-relation 1342. Up to 285 conditions per place. [2022-12-06 07:12:41,696 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 83 selfloop transitions, 9 changer transitions 4/96 dead transitions. [2022-12-06 07:12:41,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 96 transitions, 511 flow [2022-12-06 07:12:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:12:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:12:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-06 07:12:41,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2022-12-06 07:12:41,701 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 122 flow. Second operand 7 states and 88 transitions. [2022-12-06 07:12:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 96 transitions, 511 flow [2022-12-06 07:12:41,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 96 transitions, 485 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 07:12:41,707 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 179 flow [2022-12-06 07:12:41,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-12-06 07:12:41,708 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2022-12-06 07:12:41,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:41,708 INFO L89 Accepts]: Start accepts. Operand has 40 places, 38 transitions, 179 flow [2022-12-06 07:12:41,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:41,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:41,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 38 transitions, 179 flow [2022-12-06 07:12:41,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 179 flow [2022-12-06 07:12:41,723 INFO L130 PetriNetUnfolder]: 22/129 cut-off events. [2022-12-06 07:12:41,723 INFO L131 PetriNetUnfolder]: For 55/60 co-relation queries the response was YES. [2022-12-06 07:12:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 129 events. 22/129 cut-off events. For 55/60 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 612 event pairs, 0 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 206. Up to 18 conditions per place. [2022-12-06 07:12:41,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 179 flow [2022-12-06 07:12:41,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:12:42,404 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:42,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-06 07:12:42,405 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 176 flow [2022-12-06 07:12:42,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:42,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:42,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:42,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:12:42,405 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:12:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1366789735, now seen corresponding path program 1 times [2022-12-06 07:12:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:42,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605820477] [2022-12-06 07:12:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:42,545 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:12:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:42,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605820477] [2022-12-06 07:12:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605820477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:42,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:42,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:12:42,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397729600] [2022-12-06 07:12:42,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:42,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:12:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:12:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:12:42,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:12:42,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 176 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:42,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:42,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:12:42,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:42,794 INFO L130 PetriNetUnfolder]: 365/677 cut-off events. [2022-12-06 07:12:42,794 INFO L131 PetriNetUnfolder]: For 695/695 co-relation queries the response was YES. [2022-12-06 07:12:42,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 677 events. 365/677 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3142 event pairs, 192 based on Foata normal form. 27/622 useless extension candidates. Maximal degree in co-relation 1602. Up to 501 conditions per place. [2022-12-06 07:12:42,797 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 69 selfloop transitions, 5 changer transitions 4/78 dead transitions. [2022-12-06 07:12:42,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 78 transitions, 463 flow [2022-12-06 07:12:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 07:12:42,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5307692307692308 [2022-12-06 07:12:42,799 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 176 flow. Second operand 5 states and 69 transitions. [2022-12-06 07:12:42,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 78 transitions, 463 flow [2022-12-06 07:12:42,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 441 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:12:42,804 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 216 flow [2022-12-06 07:12:42,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-06 07:12:42,805 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 19 predicate places. [2022-12-06 07:12:42,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:42,805 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 216 flow [2022-12-06 07:12:42,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:42,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:42,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 216 flow [2022-12-06 07:12:42,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 216 flow [2022-12-06 07:12:42,818 INFO L130 PetriNetUnfolder]: 23/135 cut-off events. [2022-12-06 07:12:42,818 INFO L131 PetriNetUnfolder]: For 134/138 co-relation queries the response was YES. [2022-12-06 07:12:42,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 135 events. 23/135 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 686 event pairs, 0 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 225. Up to 17 conditions per place. [2022-12-06 07:12:42,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 216 flow [2022-12-06 07:12:42,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:12:42,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:42,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L64-2: Formula: (and (= v_~n2~0_38 (+ v_~n1~0_44 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_47|)) InVars {~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44} OutVars{~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:42,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:12:42,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 07:12:42,929 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 228 flow [2022-12-06 07:12:42,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:42,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:42,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:12:42,929 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:12:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1716379913, now seen corresponding path program 1 times [2022-12-06 07:12:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:42,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756489238] [2022-12-06 07:12:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:43,065 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:12:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:43,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756489238] [2022-12-06 07:12:43,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756489238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:43,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:43,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:12:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781545222] [2022-12-06 07:12:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:12:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:12:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:12:43,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:12:43,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 228 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:43,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:43,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:12:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:43,278 INFO L130 PetriNetUnfolder]: 339/646 cut-off events. [2022-12-06 07:12:43,278 INFO L131 PetriNetUnfolder]: For 989/989 co-relation queries the response was YES. [2022-12-06 07:12:43,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 646 events. 339/646 cut-off events. For 989/989 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3021 event pairs, 194 based on Foata normal form. 19/582 useless extension candidates. Maximal degree in co-relation 1609. Up to 310 conditions per place. [2022-12-06 07:12:43,282 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 79 selfloop transitions, 7 changer transitions 7/93 dead transitions. [2022-12-06 07:12:43,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 551 flow [2022-12-06 07:12:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:12:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:12:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 07:12:43,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 07:12:43,285 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 228 flow. Second operand 6 states and 87 transitions. [2022-12-06 07:12:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 551 flow [2022-12-06 07:12:43,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 548 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:12:43,291 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 242 flow [2022-12-06 07:12:43,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-06 07:12:43,293 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2022-12-06 07:12:43,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:43,293 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 242 flow [2022-12-06 07:12:43,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:43,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:43,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 242 flow [2022-12-06 07:12:43,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 242 flow [2022-12-06 07:12:43,307 INFO L130 PetriNetUnfolder]: 19/120 cut-off events. [2022-12-06 07:12:43,308 INFO L131 PetriNetUnfolder]: For 163/167 co-relation queries the response was YES. [2022-12-06 07:12:43,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 120 events. 19/120 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 582 event pairs, 0 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 214. Up to 15 conditions per place. [2022-12-06 07:12:43,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 242 flow [2022-12-06 07:12:43,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 07:12:43,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L64-2: Formula: (and (= v_~n2~0_38 (+ v_~n1~0_44 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_47|)) InVars {~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44} OutVars{~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:43,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:43,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:12:43,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 07:12:43,412 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 254 flow [2022-12-06 07:12:43,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:43,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:43,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:43,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:12:43,412 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:12:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1457281381, now seen corresponding path program 2 times [2022-12-06 07:12:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724657759] [2022-12-06 07:12:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:43,607 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:12:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:43,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724657759] [2022-12-06 07:12:43,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724657759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:43,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:43,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:12:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430881453] [2022-12-06 07:12:43,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:43,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:12:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:12:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:12:43,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:12:43,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 254 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:43,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:43,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:12:43,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:43,796 INFO L130 PetriNetUnfolder]: 312/605 cut-off events. [2022-12-06 07:12:43,796 INFO L131 PetriNetUnfolder]: For 1178/1178 co-relation queries the response was YES. [2022-12-06 07:12:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 605 events. 312/605 cut-off events. For 1178/1178 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2813 event pairs, 178 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 1577. Up to 470 conditions per place. [2022-12-06 07:12:43,799 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 61 selfloop transitions, 5 changer transitions 8/74 dead transitions. [2022-12-06 07:12:43,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 491 flow [2022-12-06 07:12:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 07:12:43,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-06 07:12:43,801 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 254 flow. Second operand 5 states and 64 transitions. [2022-12-06 07:12:43,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 491 flow [2022-12-06 07:12:43,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 470 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:12:43,805 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 258 flow [2022-12-06 07:12:43,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-06 07:12:43,806 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 29 predicate places. [2022-12-06 07:12:43,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:43,806 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 258 flow [2022-12-06 07:12:43,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:43,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:43,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 258 flow [2022-12-06 07:12:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 258 flow [2022-12-06 07:12:43,818 INFO L130 PetriNetUnfolder]: 16/111 cut-off events. [2022-12-06 07:12:43,818 INFO L131 PetriNetUnfolder]: For 163/170 co-relation queries the response was YES. [2022-12-06 07:12:43,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 111 events. 16/111 cut-off events. For 163/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 521 event pairs, 0 based on Foata normal form. 3/101 useless extension candidates. Maximal degree in co-relation 202. Up to 13 conditions per place. [2022-12-06 07:12:43,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 258 flow [2022-12-06 07:12:43,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 07:12:43,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:43,905 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:43,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 07:12:43,906 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 251 flow [2022-12-06 07:12:43,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:12:43,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:43,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:43,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:12:43,907 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:12:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 629353096, now seen corresponding path program 1 times [2022-12-06 07:12:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:43,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246602934] [2022-12-06 07:12:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:43,977 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:12:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246602934] [2022-12-06 07:12:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246602934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:12:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654229856] [2022-12-06 07:12:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:12:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:12:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:12:43,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:12:43,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:43,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:43,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:12:43,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:44,135 INFO L130 PetriNetUnfolder]: 335/639 cut-off events. [2022-12-06 07:12:44,136 INFO L131 PetriNetUnfolder]: For 1427/1427 co-relation queries the response was YES. [2022-12-06 07:12:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 639 events. 335/639 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2831 event pairs, 219 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 1692. Up to 268 conditions per place. [2022-12-06 07:12:44,139 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 77 selfloop transitions, 5 changer transitions 2/84 dead transitions. [2022-12-06 07:12:44,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 545 flow [2022-12-06 07:12:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 07:12:44,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 07:12:44,140 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 251 flow. Second operand 5 states and 78 transitions. [2022-12-06 07:12:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 545 flow [2022-12-06 07:12:44,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 515 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 07:12:44,146 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2022-12-06 07:12:44,148 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 30 predicate places. [2022-12-06 07:12:44,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:44,148 INFO L89 Accepts]: Start accepts. Operand has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:44,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:44,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,159 INFO L130 PetriNetUnfolder]: 16/121 cut-off events. [2022-12-06 07:12:44,159 INFO L131 PetriNetUnfolder]: For 130/131 co-relation queries the response was YES. [2022-12-06 07:12:44,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 121 events. 16/121 cut-off events. For 130/131 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 595 event pairs, 0 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 218. Up to 14 conditions per place. [2022-12-06 07:12:44,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:12:44,162 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:44,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:12:44,163 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 227 flow [2022-12-06 07:12:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:44,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:44,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:44,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:12:44,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 256080761, now seen corresponding path program 1 times [2022-12-06 07:12:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:44,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404508468] [2022-12-06 07:12:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:44,201 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:12:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404508468] [2022-12-06 07:12:44,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404508468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:44,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:44,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:12:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174403509] [2022-12-06 07:12:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:44,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:12:44,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:44,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:12:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:12:44,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:12:44,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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:12:44,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:44,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:12:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:44,324 INFO L130 PetriNetUnfolder]: 246/476 cut-off events. [2022-12-06 07:12:44,325 INFO L131 PetriNetUnfolder]: For 1003/1003 co-relation queries the response was YES. [2022-12-06 07:12:44,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 476 events. 246/476 cut-off events. For 1003/1003 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1967 event pairs, 157 based on Foata normal form. 16/490 useless extension candidates. Maximal degree in co-relation 1461. Up to 373 conditions per place. [2022-12-06 07:12:44,327 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 30 selfloop transitions, 0 changer transitions 22/52 dead transitions. [2022-12-06 07:12:44,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 352 flow [2022-12-06 07:12:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:12:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:12:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 07:12:44,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-06 07:12:44,327 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 227 flow. Second operand 4 states and 45 transitions. [2022-12-06 07:12:44,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 352 flow [2022-12-06 07:12:44,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 336 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 07:12:44,330 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 151 flow [2022-12-06 07:12:44,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2022-12-06 07:12:44,331 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2022-12-06 07:12:44,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:44,331 INFO L89 Accepts]: Start accepts. Operand has 52 places, 30 transitions, 151 flow [2022-12-06 07:12:44,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:44,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:44,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 30 transitions, 151 flow [2022-12-06 07:12:44,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 151 flow [2022-12-06 07:12:44,338 INFO L130 PetriNetUnfolder]: 12/66 cut-off events. [2022-12-06 07:12:44,338 INFO L131 PetriNetUnfolder]: For 77/82 co-relation queries the response was YES. [2022-12-06 07:12:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 66 events. 12/66 cut-off events. For 77/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 1 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 138. Up to 13 conditions per place. [2022-12-06 07:12:44,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 151 flow [2022-12-06 07:12:44,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 07:12:44,341 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:44,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:12:44,342 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 151 flow [2022-12-06 07:12:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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:12:44,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:44,343 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:12:44,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:12:44,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash 686395712, now seen corresponding path program 1 times [2022-12-06 07:12:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:44,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841082446] [2022-12-06 07:12:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841082446] [2022-12-06 07:12:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841082446] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:44,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889855985] [2022-12-06 07:12:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:44,781 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:12:44,782 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:12:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:44,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:12:44,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:44,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:12:44,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:12:45,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:12:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:45,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:45,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:45,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-12-06 07:12:45,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:45,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 274 [2022-12-06 07:12:45,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:45,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 239 [2022-12-06 07:12:45,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:45,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 223 [2022-12-06 07:12:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889855985] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:45,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:45,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-12-06 07:12:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114886802] [2022-12-06 07:12:45,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:12:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:12:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=276, Unknown=10, NotChecked=0, Total=380 [2022-12-06 07:12:45,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:12:45,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 151 flow. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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:12:45,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:45,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:12:45,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:46,715 INFO L130 PetriNetUnfolder]: 611/1059 cut-off events. [2022-12-06 07:12:46,715 INFO L131 PetriNetUnfolder]: For 2239/2239 co-relation queries the response was YES. [2022-12-06 07:12:46,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 1059 events. 611/1059 cut-off events. For 2239/2239 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5088 event pairs, 144 based on Foata normal form. 24/1081 useless extension candidates. Maximal degree in co-relation 3486. Up to 222 conditions per place. [2022-12-06 07:12:46,720 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 158 selfloop transitions, 36 changer transitions 1/195 dead transitions. [2022-12-06 07:12:46,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 195 transitions, 1251 flow [2022-12-06 07:12:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:12:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:12:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 193 transitions. [2022-12-06 07:12:46,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2022-12-06 07:12:46,722 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 151 flow. Second operand 20 states and 193 transitions. [2022-12-06 07:12:46,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 195 transitions, 1251 flow [2022-12-06 07:12:46,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 195 transitions, 1137 flow, removed 51 selfloop flow, removed 6 redundant places. [2022-12-06 07:12:46,728 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 431 flow [2022-12-06 07:12:46,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=431, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2022-12-06 07:12:46,736 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2022-12-06 07:12:46,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:46,737 INFO L89 Accepts]: Start accepts. Operand has 73 places, 60 transitions, 431 flow [2022-12-06 07:12:46,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:46,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:46,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 60 transitions, 431 flow [2022-12-06 07:12:46,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 431 flow [2022-12-06 07:12:46,778 INFO L130 PetriNetUnfolder]: 55/241 cut-off events. [2022-12-06 07:12:46,778 INFO L131 PetriNetUnfolder]: For 766/783 co-relation queries the response was YES. [2022-12-06 07:12:46,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 241 events. 55/241 cut-off events. For 766/783 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1430 event pairs, 3 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 744. Up to 48 conditions per place. [2022-12-06 07:12:46,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 60 transitions, 431 flow [2022-12-06 07:12:46,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 07:12:47,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L51-1-->L51-3: Formula: (and (= (select (select |v_#memory_int_65| v_~a2~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_37| 4) v_~a2~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem2#1_23|) (not (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| |v_thread1Thread1of1ForFork0_#t~mem2#1_23|))) InVars {~a2~0.base=v_~a2~0.base_19, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|, #memory_int=|v_#memory_int_65|, ~a2~0.offset=v_~a2~0.offset_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|} OutVars{~a2~0.base=v_~a2~0.base_19, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|, #memory_int=|v_#memory_int_65|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~a2~0.offset=v_~a2~0.offset_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:12:47,748 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:12:47,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1012 [2022-12-06 07:12:47,748 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 415 flow [2022-12-06 07:12:47,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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:12:47,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:47,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:47,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:12:47,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:47,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash 320698008, now seen corresponding path program 1 times [2022-12-06 07:12:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:47,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249570001] [2022-12-06 07:12:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:48,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:48,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249570001] [2022-12-06 07:12:48,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249570001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:48,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:48,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:12:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999610122] [2022-12-06 07:12:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:48,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:12:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:12:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:12:48,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:12:48,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 415 flow. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:48,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:48,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:12:48,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:48,450 INFO L130 PetriNetUnfolder]: 611/1057 cut-off events. [2022-12-06 07:12:48,450 INFO L131 PetriNetUnfolder]: For 5704/5704 co-relation queries the response was YES. [2022-12-06 07:12:48,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 1057 events. 611/1057 cut-off events. For 5704/5704 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5017 event pairs, 261 based on Foata normal form. 2/1058 useless extension candidates. Maximal degree in co-relation 4090. Up to 550 conditions per place. [2022-12-06 07:12:48,457 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 98 selfloop transitions, 12 changer transitions 1/111 dead transitions. [2022-12-06 07:12:48,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 1027 flow [2022-12-06 07:12:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:12:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:12:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 07:12:48,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2022-12-06 07:12:48,458 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 415 flow. Second operand 7 states and 91 transitions. [2022-12-06 07:12:48,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 1027 flow [2022-12-06 07:12:48,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 111 transitions, 919 flow, removed 41 selfloop flow, removed 7 redundant places. [2022-12-06 07:12:48,469 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 444 flow [2022-12-06 07:12:48,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2022-12-06 07:12:48,470 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 44 predicate places. [2022-12-06 07:12:48,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:48,470 INFO L89 Accepts]: Start accepts. Operand has 69 places, 60 transitions, 444 flow [2022-12-06 07:12:48,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:48,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:48,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 60 transitions, 444 flow [2022-12-06 07:12:48,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 60 transitions, 444 flow [2022-12-06 07:12:48,491 INFO L130 PetriNetUnfolder]: 64/267 cut-off events. [2022-12-06 07:12:48,491 INFO L131 PetriNetUnfolder]: For 839/885 co-relation queries the response was YES. [2022-12-06 07:12:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 267 events. 64/267 cut-off events. For 839/885 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1616 event pairs, 5 based on Foata normal form. 5/263 useless extension candidates. Maximal degree in co-relation 936. Up to 57 conditions per place. [2022-12-06 07:12:48,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 60 transitions, 444 flow [2022-12-06 07:12:48,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 07:12:48,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L64-2-->thread2EXIT: Formula: (let ((.cse1 (< |v_thread2Thread1of1ForFork1_~i~1#1_In_14| v_~n2~0_In_13)) (.cse2 (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_20| 0)) (.cse0 (< |v_thread2Thread1of1ForFork1_~i~1#1_In_14| v_~n1~0_In_11)) (.cse3 (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_20| 0))) (or (and (or (not .cse0) (not .cse1)) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem8#1_Out_14| |v_thread2Thread1of1ForFork1_#t~mem8#1_In_2|) (= |v_thread2Thread1of1ForFork1_#t~ret11#1_Out_16| |v_thread2Thread1of1ForFork1_#t~ret11#1_In_3|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_In_2| |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|) (= v_~res2~0_Out_32 v_~res2~0_In_12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|) .cse3 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem10#1_Out_24|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_Out_24| |v_thread2Thread1of1ForFork1_#t~mem9#1_In_4|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_In_9| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) (= |v_thread2Thread1of1ForFork1_#t~mem7#1_In_2| |v_thread2Thread1of1ForFork1_#t~mem7#1_Out_12|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_~b#1_In_8|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| |v_thread2Thread1of1ForFork1_minus_#in~a#1_In_5|)) (let ((.cse6 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_In_14|))) (let ((.cse4 (select (select |v_#memory_int_In_29| v_~a1~0.base_In_10) (+ .cse6 v_~a1~0.offset_In_10))) (.cse5 (select (select |v_#memory_int_In_29| v_~a2~0.base_In_9) (+ v_~a2~0.offset_In_9 .cse6)))) (and (<= 0 (+ v_~res2~0_Out_32 2147483648)) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) (= .cse4 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|) (<= v_~res2~0_Out_32 2147483647) (not (= .cse5 .cse4)) .cse0 (= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12| (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) .cse3 (= v_~res2~0_Out_32 |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| .cse5) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|)))))) InVars {thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_In_2|, ~n2~0=v_~n2~0_In_13, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_In_3|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_In_8|, ~n1~0=v_~n1~0_In_11, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_In_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_14|, ~a1~0.base=v_~a1~0.base_In_10, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_In_9|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|, ~a2~0.base=v_~a2~0.base_In_9, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_In_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_In_2|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_In_5|, ~a1~0.offset=v_~a1~0.offset_In_10, #memory_int=|v_#memory_int_In_29|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_In_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4|, ~a2~0.offset=v_~a2~0.offset_In_9, ~res2~0=v_~res2~0_In_12} OutVars{thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_Out_14|, ~n2~0=v_~n2~0_In_13, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_Out_16|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|, ~n1~0=v_~n1~0_In_11, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_20|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_14|, ~a1~0.base=v_~a1~0.base_In_10, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|, ~a2~0.base=v_~a2~0.base_In_9, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_20|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_Out_24|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_Out_12|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_Out_24|, ~a1~0.offset=v_~a1~0.offset_In_10, #memory_int=|v_#memory_int_In_29|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|, ~a2~0.offset=v_~a2~0.offset_In_9, ~res2~0=v_~res2~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [858] L51-1-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_46| (select (select |v_#memory_int_187| v_~a2~0.base_93) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_80| 4) v_~a2~0.offset_93))) (= |v_thread1Thread1of1ForFork0_~i~0#1_79| (+ |v_thread1Thread1of1ForFork0_~i~0#1_80| 1))) InVars {~a2~0.base=v_~a2~0.base_93, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_80|, #memory_int=|v_#memory_int_187|, ~a2~0.offset=v_~a2~0.offset_93, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_46|} OutVars{~a2~0.base=v_~a2~0.base_93, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_19|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, #memory_int=|v_#memory_int_187|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_39|, ~a2~0.offset=v_~a2~0.offset_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:12:48,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L64-2: Formula: (and (= v_~n2~0_38 (+ v_~n1~0_44 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_47|)) InVars {~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44} OutVars{~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] and [858] L51-1-->L50-2: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~mem1#1_46| (select (select |v_#memory_int_187| v_~a2~0.base_93) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_80| 4) v_~a2~0.offset_93))) (= |v_thread1Thread1of1ForFork0_~i~0#1_79| (+ |v_thread1Thread1of1ForFork0_~i~0#1_80| 1))) InVars {~a2~0.base=v_~a2~0.base_93, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_80|, #memory_int=|v_#memory_int_187|, ~a2~0.offset=v_~a2~0.offset_93, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_46|} OutVars{~a2~0.base=v_~a2~0.base_93, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_19|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, #memory_int=|v_#memory_int_187|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_39|, ~a2~0.offset=v_~a2~0.offset_93} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:12:49,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L64-2: Formula: (and (= v_~n2~0_38 (+ v_~n1~0_44 v_~res2~0_45)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_47|)) InVars {~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44} OutVars{~n2~0=v_~n2~0_38, ~n1~0=v_~n1~0_44, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~res2~0=v_~res2~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] and [902] L50-2-->L50-2: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_152| v_~n2~0_108) (= |v_thread1Thread1of1ForFork0_~i~0#1_151| (+ |v_thread1Thread1of1ForFork0_~i~0#1_152| 1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_152| v_~n1~0_102) (let ((.cse0 (* |v_thread1Thread1of1ForFork0_~i~0#1_152| 4))) (= (select (select |v_#memory_int_309| v_~a2~0.base_155) (+ v_~a2~0.offset_155 .cse0)) (select (select |v_#memory_int_309| v_~a1~0.base_114) (+ v_~a1~0.offset_114 .cse0))))) InVars {~a2~0.base=v_~a2~0.base_155, ~n2~0=v_~n2~0_108, ~n1~0=v_~n1~0_102, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, #memory_int=|v_#memory_int_309|, ~a1~0.offset=v_~a1~0.offset_114, ~a2~0.offset=v_~a2~0.offset_155, ~a1~0.base=v_~a1~0.base_114} OutVars{~a2~0.base=v_~a2~0.base_155, ~n2~0=v_~n2~0_108, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_32|, ~n1~0=v_~n1~0_102, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_151|, #memory_int=|v_#memory_int_309|, ~a1~0.offset=v_~a1~0.offset_114, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_80|, ~a2~0.offset=v_~a2~0.offset_155, ~a1~0.base=v_~a1~0.base_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:12:49,423 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:12:49,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 954 [2022-12-06 07:12:49,424 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 501 flow [2022-12-06 07:12:49,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:49,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:49,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:12:49,424 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash 744007450, now seen corresponding path program 1 times [2022-12-06 07:12:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:49,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908835776] [2022-12-06 07:12:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:49,672 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:12:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908835776] [2022-12-06 07:12:49,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908835776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:49,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:49,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:12:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044329136] [2022-12-06 07:12:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:12:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:12:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:49,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:12:49,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:12:49,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:49,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:12:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:49,887 INFO L130 PetriNetUnfolder]: 630/1087 cut-off events. [2022-12-06 07:12:49,888 INFO L131 PetriNetUnfolder]: For 6298/6298 co-relation queries the response was YES. [2022-12-06 07:12:49,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 1087 events. 630/1087 cut-off events. For 6298/6298 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5235 event pairs, 280 based on Foata normal form. 12/1099 useless extension candidates. Maximal degree in co-relation 5145. Up to 549 conditions per place. [2022-12-06 07:12:49,893 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 90 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2022-12-06 07:12:49,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 954 flow [2022-12-06 07:12:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:12:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:12:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 07:12:49,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2022-12-06 07:12:49,894 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 501 flow. Second operand 6 states and 81 transitions. [2022-12-06 07:12:49,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 954 flow [2022-12-06 07:12:49,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 903 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 07:12:49,904 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2022-12-06 07:12:49,906 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 44 predicate places. [2022-12-06 07:12:49,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:49,906 INFO L89 Accepts]: Start accepts. Operand has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:49,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:49,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,928 INFO L130 PetriNetUnfolder]: 68/283 cut-off events. [2022-12-06 07:12:49,928 INFO L131 PetriNetUnfolder]: For 1059/1095 co-relation queries the response was YES. [2022-12-06 07:12:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 283 events. 68/283 cut-off events. For 1059/1095 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1772 event pairs, 6 based on Foata normal form. 2/274 useless extension candidates. Maximal degree in co-relation 811. Up to 62 conditions per place. [2022-12-06 07:12:49,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 07:12:49,930 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:49,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 07:12:49,931 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 490 flow [2022-12-06 07:12:49,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:12:49,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:49,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:12:49,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -670242408, now seen corresponding path program 1 times [2022-12-06 07:12:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802543881] [2022-12-06 07:12:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:50,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802543881] [2022-12-06 07:12:50,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802543881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:50,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:12:50,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:12:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685488221] [2022-12-06 07:12:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:50,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:12:50,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:12:50,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:50,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:12:50,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:12:50,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:50,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:12:50,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:50,453 INFO L130 PetriNetUnfolder]: 628/1085 cut-off events. [2022-12-06 07:12:50,453 INFO L131 PetriNetUnfolder]: For 6070/6070 co-relation queries the response was YES. [2022-12-06 07:12:50,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5188 conditions, 1085 events. 628/1085 cut-off events. For 6070/6070 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5244 event pairs, 290 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 3804. Up to 548 conditions per place. [2022-12-06 07:12:50,459 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 83 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2022-12-06 07:12:50,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 927 flow [2022-12-06 07:12:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:12:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:12:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 07:12:50,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34684684684684686 [2022-12-06 07:12:50,461 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 490 flow. Second operand 6 states and 77 transitions. [2022-12-06 07:12:50,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 927 flow [2022-12-06 07:12:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 899 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 07:12:50,474 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2022-12-06 07:12:50,475 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 46 predicate places. [2022-12-06 07:12:50,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:50,475 INFO L89 Accepts]: Start accepts. Operand has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:50,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:50,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,497 INFO L130 PetriNetUnfolder]: 66/276 cut-off events. [2022-12-06 07:12:50,497 INFO L131 PetriNetUnfolder]: For 1088/1129 co-relation queries the response was YES. [2022-12-06 07:12:50,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 276 events. 66/276 cut-off events. For 1088/1129 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1720 event pairs, 6 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 830. Up to 61 conditions per place. [2022-12-06 07:12:50,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 07:12:50,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:50,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:12:50,500 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 483 flow [2022-12-06 07:12:50,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:12:50,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:50,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:50,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:12:50,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 783965907, now seen corresponding path program 1 times [2022-12-06 07:12:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301355032] [2022-12-06 07:12:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:50,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301355032] [2022-12-06 07:12:50,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301355032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:50,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254840983] [2022-12-06 07:12:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:50,745 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:12:50,763 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:12:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:50,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:12:50,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:51,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:51,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 115 [2022-12-06 07:12:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:51,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:12:51,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254840983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:12:51,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:12:51,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-12-06 07:12:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339618536] [2022-12-06 07:12:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:51,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:12:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:12:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:12:51,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:12:51,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 483 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:51,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:51,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:12:51,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:51,630 INFO L130 PetriNetUnfolder]: 1042/1829 cut-off events. [2022-12-06 07:12:51,630 INFO L131 PetriNetUnfolder]: For 10811/10811 co-relation queries the response was YES. [2022-12-06 07:12:51,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8812 conditions, 1829 events. 1042/1829 cut-off events. For 10811/10811 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10204 event pairs, 249 based on Foata normal form. 40/1869 useless extension candidates. Maximal degree in co-relation 7066. Up to 1067 conditions per place. [2022-12-06 07:12:51,644 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 143 selfloop transitions, 25 changer transitions 4/172 dead transitions. [2022-12-06 07:12:51,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 172 transitions, 1674 flow [2022-12-06 07:12:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:12:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:12:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-06 07:12:51,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-06 07:12:51,645 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 483 flow. Second operand 9 states and 123 transitions. [2022-12-06 07:12:51,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 172 transitions, 1674 flow [2022-12-06 07:12:51,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 172 transitions, 1632 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 07:12:51,663 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 799 flow [2022-12-06 07:12:51,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=799, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2022-12-06 07:12:51,664 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 56 predicate places. [2022-12-06 07:12:51,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:51,664 INFO L89 Accepts]: Start accepts. Operand has 81 places, 82 transitions, 799 flow [2022-12-06 07:12:51,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:51,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:51,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 82 transitions, 799 flow [2022-12-06 07:12:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 82 transitions, 799 flow [2022-12-06 07:12:51,702 INFO L130 PetriNetUnfolder]: 103/453 cut-off events. [2022-12-06 07:12:51,702 INFO L131 PetriNetUnfolder]: For 2536/2605 co-relation queries the response was YES. [2022-12-06 07:12:51,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 453 events. 103/453 cut-off events. For 2536/2605 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3363 event pairs, 6 based on Foata normal form. 6/446 useless extension candidates. Maximal degree in co-relation 1548. Up to 103 conditions per place. [2022-12-06 07:12:51,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 82 transitions, 799 flow [2022-12-06 07:12:51,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 07:12:51,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [907] $Ultimate##0-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork1_#res#1.offset_33| 0)) (.cse2 (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_33|)) (.cse0 (< |v_thread2Thread1of1ForFork1_~i~1#1_81| v_~n2~0_114)) (.cse5 (< |v_thread2Thread1of1ForFork1_~i~1#1_81| v_~n1~0_108))) (or (let ((.cse6 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_81|))) (let ((.cse3 (select (select |v_#memory_int_321| v_~a2~0.base_165) (+ .cse6 v_~a2~0.offset_165))) (.cse4 (select (select |v_#memory_int_321| v_~a1~0.base_120) (+ .cse6 v_~a1~0.offset_120)))) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_minus_~a#1_66| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_68| |v_thread2Thread1of1ForFork1_minus_#res#1_48|)) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_66| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_68|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_68|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|) (<= 0 (+ v_~res2~0_100 2147483648)) (not (= .cse3 .cse4)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_66| |v_thread2Thread1of1ForFork1_minus_#in~a#1_38|) (<= v_~res2~0_100 2147483647) .cse5 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|) (= .cse3 |v_thread2Thread1of1ForFork1_minus_#in~a#1_38|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_48| v_~res2~0_100) (= .cse4 |v_thread2Thread1of1ForFork1_minus_#in~b#1_38|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_68| |v_thread2Thread1of1ForFork1_minus_#in~b#1_38|)))) (and (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_39| |v_thread2Thread1of1ForFork1_minus_#in~a#1_38|) (= |v_thread2Thread1of1ForFork1_#t~mem8#1_55| |v_thread2Thread1of1ForFork1_#t~mem8#1_54|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_49| |v_thread2Thread1of1ForFork1_#t~mem9#1_48|) .cse1 .cse2 (= v_~n2~0_114 (+ v_~n1~0_108 v_~res2~0_100)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_39| |v_thread2Thread1of1ForFork1_minus_#in~b#1_38|) (= |v_thread2Thread1of1ForFork1_#t~ret11#1_45| |v_thread2Thread1of1ForFork1_#t~ret11#1_44|) (= |v_thread2Thread1of1ForFork1_#t~mem7#1_55| |v_thread2Thread1of1ForFork1_#t~mem7#1_54|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_67| |v_thread2Thread1of1ForFork1_minus_~a#1_66|) (= |v_thread2Thread1of1ForFork1_#t~mem10#1_47| |v_thread2Thread1of1ForFork1_#t~mem10#1_46|) (or (not .cse0) (not .cse5)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_49| |v_thread2Thread1of1ForFork1_minus_#res#1_48|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_69| |v_thread2Thread1of1ForFork1_minus_~b#1_68|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|)))) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_81|)) InVars {thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_55|, ~n2~0=v_~n2~0_114, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_45|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_69|, ~n1~0=v_~n1~0_108, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, ~a1~0.base=v_~a1~0.base_120, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|, ~a2~0.base=v_~a2~0.base_165, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_49|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_55|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_39|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_47|, ~a1~0.offset=v_~a1~0.offset_120, #memory_int=|v_#memory_int_321|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_39|, ~a2~0.offset=v_~a2~0.offset_165} OutVars{thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_54|, ~n2~0=v_~n2~0_114, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_44|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_68|, ~n1~0=v_~n1~0_108, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_33|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_64|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_81|, ~a1~0.base=v_~a1~0.base_120, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_66|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_78|, ~a2~0.base=v_~a2~0.base_165, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_33|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_48|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_54|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_38|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_46|, ~a1~0.offset=v_~a1~0.offset_120, #memory_int=|v_#memory_int_321|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_38|, ~a2~0.offset=v_~a2~0.offset_165, ~res2~0=v_~res2~0_100} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:12:52,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L64-2-->thread2EXIT: Formula: (let ((.cse1 (< |v_thread2Thread1of1ForFork1_~i~1#1_In_14| v_~n2~0_In_13)) (.cse2 (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_20| 0)) (.cse0 (< |v_thread2Thread1of1ForFork1_~i~1#1_In_14| v_~n1~0_In_11)) (.cse3 (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_20| 0))) (or (and (or (not .cse0) (not .cse1)) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem8#1_Out_14| |v_thread2Thread1of1ForFork1_#t~mem8#1_In_2|) (= |v_thread2Thread1of1ForFork1_#t~ret11#1_Out_16| |v_thread2Thread1of1ForFork1_#t~ret11#1_In_3|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_In_2| |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|) (= v_~res2~0_Out_32 v_~res2~0_In_12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|) .cse3 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem10#1_Out_24|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_Out_24| |v_thread2Thread1of1ForFork1_#t~mem9#1_In_4|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_In_9| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) (= |v_thread2Thread1of1ForFork1_#t~mem7#1_In_2| |v_thread2Thread1of1ForFork1_#t~mem7#1_Out_12|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_~b#1_In_8|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| |v_thread2Thread1of1ForFork1_minus_#in~a#1_In_5|)) (let ((.cse6 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_In_14|))) (let ((.cse4 (select (select |v_#memory_int_In_29| v_~a1~0.base_In_10) (+ .cse6 v_~a1~0.offset_In_10))) (.cse5 (select (select |v_#memory_int_In_29| v_~a2~0.base_In_9) (+ v_~a2~0.offset_In_9 .cse6)))) (and (<= 0 (+ v_~res2~0_Out_32 2147483648)) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) (= .cse4 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|) (<= v_~res2~0_Out_32 2147483647) (not (= .cse5 .cse4)) .cse0 (= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12| (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|) .cse3 (= v_~res2~0_Out_32 |v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16| .cse5) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|)))))) InVars {thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_In_2|, ~n2~0=v_~n2~0_In_13, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_In_3|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_In_8|, ~n1~0=v_~n1~0_In_11, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_In_2|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_14|, ~a1~0.base=v_~a1~0.base_In_10, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_In_9|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|, ~a2~0.base=v_~a2~0.base_In_9, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_In_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_In_2|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_In_5|, ~a1~0.offset=v_~a1~0.offset_In_10, #memory_int=|v_#memory_int_In_29|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_In_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4|, ~a2~0.offset=v_~a2~0.offset_In_9, ~res2~0=v_~res2~0_In_12} OutVars{thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_Out_14|, ~n2~0=v_~n2~0_In_13, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_Out_16|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|, ~n1~0=v_~n1~0_In_11, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_20|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_16|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_18|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_14|, ~a1~0.base=v_~a1~0.base_In_10, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_26|, ~a2~0.base=v_~a2~0.base_In_9, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_20|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_Out_24|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_Out_12|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_16|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_Out_24|, ~a1~0.offset=v_~a1~0.offset_In_10, #memory_int=|v_#memory_int_In_29|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_16|, ~a2~0.offset=v_~a2~0.offset_In_9, ~res2~0=v_~res2~0_Out_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~res2~0] and [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:12:52,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [888] L102-6-->L84-3: Formula: (and (= (store |v_#valid_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107| 1) |v_#valid_130|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_127| 0) (= (+ |v_#pthreadsForks_134| 1) |v_#pthreadsForks_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|) (= v_~a1~0.base_95 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_108|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107| |v_#StackHeapBarrier_54|) (= (select |v_#valid_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_91| v_~a2~0.offset_129) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_91| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~n2~0_86) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_108| v_~a1~0.offset_95) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_161| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_128| |v_ULTIMATE.start_create_fresh_int_array_~size#1_118|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_161| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_193|) (= |v_ULTIMATE.start_main_#t~pre17#1_93| |v_#pthreadsForks_134|) (= (store |v_#length_124| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_117| 1073741824))) |v_#length_123|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|) 1 0) 0)) (= v_~a2~0.base_129 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_91|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_127| |v_ULTIMATE.start_create_fresh_int_array_~size#1_117|)) (= (store |v_#memory_int_258| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_258| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre17#1_93|)) |v_#memory_int_257|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_108|, #StackHeapBarrier=|v_#StackHeapBarrier_54|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_108|, #pthreadsForks=|v_#pthreadsForks_134|, ~n2~0=v_~n2~0_86, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_258|, #length=|v_#length_124|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_128|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_118|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_99|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_107|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_57|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_91|, ~a1~0.base=v_~a1~0.base_95, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_93|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~a2~0.base=v_~a2~0.base_129, #pthreadsForks=|v_#pthreadsForks_133|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_57|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_193|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_99|, #length=|v_#length_123|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_127|, ~a2~0.offset=v_~a2~0.offset_129, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_94|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_107|, ~n2~0=v_~n2~0_86, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_117|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_91|, #StackHeapBarrier=|v_#StackHeapBarrier_54|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_57|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_257|, ~a1~0.offset=v_~a1~0.offset_95, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_73|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_161|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_#t~pre17#1, ~a2~0.base, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~a2~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, #memory_int, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] [2022-12-06 07:12:58,736 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:12:58,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7073 [2022-12-06 07:12:58,737 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 843 flow [2022-12-06 07:12:58,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:12:58,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:58,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:58,751 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:12:58,937 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,SelfDestructingSolverStorable11 [2022-12-06 07:12:58,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:12:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 792584485, now seen corresponding path program 1 times [2022-12-06 07:12:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:58,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331392851] [2022-12-06 07:12:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331392851] [2022-12-06 07:12:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331392851] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452331081] [2022-12-06 07:12:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:59,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:59,248 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:12:59,249 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:12:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:12:59,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:59,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:12:59,352 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-06 07:12:59,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-06 07:12:59,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 07:12:59,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 07:12:59,380 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:12:59,381 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2022-12-06 07:12:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:12:59,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-12-06 07:12:59,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 07:12:59,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:12:59,498 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 07:12:59,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 259 treesize of output 243 [2022-12-06 07:12:59,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 07:12:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:59,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:59,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452331081] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:59,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:12:59,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 11 [2022-12-06 07:12:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435643011] [2022-12-06 07:12:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:12:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:12:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:12:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=86, Unknown=1, NotChecked=0, Total=132 [2022-12-06 07:12:59,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:12:59,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 843 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:12:59,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:59,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:12:59,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:00,317 INFO L130 PetriNetUnfolder]: 1027/1827 cut-off events. [2022-12-06 07:13:00,317 INFO L131 PetriNetUnfolder]: For 14980/14980 co-relation queries the response was YES. [2022-12-06 07:13:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 1827 events. 1027/1827 cut-off events. For 14980/14980 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10257 event pairs, 445 based on Foata normal form. 18/1844 useless extension candidates. Maximal degree in co-relation 7506. Up to 1089 conditions per place. [2022-12-06 07:13:00,335 INFO L137 encePairwiseOnDemand]: 27/42 looper letters, 138 selfloop transitions, 32 changer transitions 1/171 dead transitions. [2022-12-06 07:13:00,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 171 transitions, 1920 flow [2022-12-06 07:13:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:13:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:13:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-12-06 07:13:00,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2022-12-06 07:13:00,336 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 843 flow. Second operand 7 states and 118 transitions. [2022-12-06 07:13:00,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 171 transitions, 1920 flow [2022-12-06 07:13:00,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 171 transitions, 1808 flow, removed 56 selfloop flow, removed 0 redundant places. [2022-12-06 07:13:00,368 INFO L231 Difference]: Finished difference. Result has 92 places, 100 transitions, 1151 flow [2022-12-06 07:13:00,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1151, PETRI_PLACES=92, PETRI_TRANSITIONS=100} [2022-12-06 07:13:00,369 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 67 predicate places. [2022-12-06 07:13:00,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:00,370 INFO L89 Accepts]: Start accepts. Operand has 92 places, 100 transitions, 1151 flow [2022-12-06 07:13:00,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:00,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:00,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 100 transitions, 1151 flow [2022-12-06 07:13:00,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 100 transitions, 1151 flow [2022-12-06 07:13:00,410 INFO L130 PetriNetUnfolder]: 103/469 cut-off events. [2022-12-06 07:13:00,410 INFO L131 PetriNetUnfolder]: For 3313/3403 co-relation queries the response was YES. [2022-12-06 07:13:00,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 469 events. 103/469 cut-off events. For 3313/3403 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3555 event pairs, 6 based on Foata normal form. 12/468 useless extension candidates. Maximal degree in co-relation 1726. Up to 79 conditions per place. [2022-12-06 07:13:00,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 100 transitions, 1151 flow [2022-12-06 07:13:00,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 664 [2022-12-06 07:13:00,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:13:00,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:13:00,442 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 1159 flow [2022-12-06 07:13:00,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:00,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:00,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:00,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:13:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:00,647 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1575008103, now seen corresponding path program 1 times [2022-12-06 07:13:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:00,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712304633] [2022-12-06 07:13:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:01,083 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:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:01,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712304633] [2022-12-06 07:13:01,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712304633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:01,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:01,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:13:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679062648] [2022-12-06 07:13:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:01,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:13:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:13:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:13:01,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:13:01,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 1159 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:01,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:01,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:13:01,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:01,440 INFO L130 PetriNetUnfolder]: 1040/1854 cut-off events. [2022-12-06 07:13:01,441 INFO L131 PetriNetUnfolder]: For 17847/17847 co-relation queries the response was YES. [2022-12-06 07:13:01,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10328 conditions, 1854 events. 1040/1854 cut-off events. For 17847/17847 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10546 event pairs, 321 based on Foata normal form. 1/1855 useless extension candidates. Maximal degree in co-relation 8642. Up to 1067 conditions per place. [2022-12-06 07:13:01,452 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 126 selfloop transitions, 26 changer transitions 7/159 dead transitions. [2022-12-06 07:13:01,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 159 transitions, 1929 flow [2022-12-06 07:13:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:13:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:13:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-06 07:13:01,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3231707317073171 [2022-12-06 07:13:01,454 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 1159 flow. Second operand 8 states and 106 transitions. [2022-12-06 07:13:01,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 159 transitions, 1929 flow [2022-12-06 07:13:01,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 159 transitions, 1827 flow, removed 51 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:01,490 INFO L231 Difference]: Finished difference. Result has 102 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1303, PETRI_PLACES=102, PETRI_TRANSITIONS=112} [2022-12-06 07:13:01,490 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2022-12-06 07:13:01,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:01,491 INFO L89 Accepts]: Start accepts. Operand has 102 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:01,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:01,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,535 INFO L130 PetriNetUnfolder]: 108/488 cut-off events. [2022-12-06 07:13:01,535 INFO L131 PetriNetUnfolder]: For 3353/3447 co-relation queries the response was YES. [2022-12-06 07:13:01,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 488 events. 108/488 cut-off events. For 3353/3447 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3720 event pairs, 5 based on Foata normal form. 16/495 useless extension candidates. Maximal degree in co-relation 2060. Up to 81 conditions per place. [2022-12-06 07:13:01,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-06 07:13:01,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:01,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 07:13:01,541 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 1303 flow [2022-12-06 07:13:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:01,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:01,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:13:01,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1085539160, now seen corresponding path program 1 times [2022-12-06 07:13:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714107051] [2022-12-06 07:13:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:01,672 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:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:01,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714107051] [2022-12-06 07:13:01,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714107051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:01,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:01,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:13:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101616073] [2022-12-06 07:13:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:01,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:13:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:13:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:13:01,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:13:01,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 1303 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:01,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:01,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:13:01,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:02,010 INFO L130 PetriNetUnfolder]: 1032/1827 cut-off events. [2022-12-06 07:13:02,011 INFO L131 PetriNetUnfolder]: For 17932/17932 co-relation queries the response was YES. [2022-12-06 07:13:02,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10286 conditions, 1827 events. 1032/1827 cut-off events. For 17932/17932 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10259 event pairs, 418 based on Foata normal form. 2/1829 useless extension candidates. Maximal degree in co-relation 10168. Up to 966 conditions per place. [2022-12-06 07:13:02,021 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 122 selfloop transitions, 38 changer transitions 6/166 dead transitions. [2022-12-06 07:13:02,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1990 flow [2022-12-06 07:13:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:13:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:13:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-06 07:13:02,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2022-12-06 07:13:02,022 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 1303 flow. Second operand 6 states and 104 transitions. [2022-12-06 07:13:02,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1990 flow [2022-12-06 07:13:02,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1944 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 07:13:02,062 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1409, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2022-12-06 07:13:02,062 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2022-12-06 07:13:02,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:02,063 INFO L89 Accepts]: Start accepts. Operand has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:02,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:02,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,104 INFO L130 PetriNetUnfolder]: 108/477 cut-off events. [2022-12-06 07:13:02,104 INFO L131 PetriNetUnfolder]: For 3896/4004 co-relation queries the response was YES. [2022-12-06 07:13:02,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2232 conditions, 477 events. 108/477 cut-off events. For 3896/4004 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3592 event pairs, 5 based on Foata normal form. 17/484 useless extension candidates. Maximal degree in co-relation 1991. Up to 84 conditions per place. [2022-12-06 07:13:02,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-06 07:13:02,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:02,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 07:13:02,110 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 1409 flow [2022-12-06 07:13:02,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:02,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:02,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:02,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:13:02,110 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:02,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1081792769, now seen corresponding path program 1 times [2022-12-06 07:13:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:02,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894569863] [2022-12-06 07:13:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:02,784 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:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894569863] [2022-12-06 07:13:02,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894569863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:02,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:02,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:13:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109647654] [2022-12-06 07:13:02,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:02,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:13:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:13:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:13:02,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:13:02,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 1409 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:02,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:02,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:13:02,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:03,324 INFO L130 PetriNetUnfolder]: 1031/1831 cut-off events. [2022-12-06 07:13:03,325 INFO L131 PetriNetUnfolder]: For 19960/19960 co-relation queries the response was YES. [2022-12-06 07:13:03,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10772 conditions, 1831 events. 1031/1831 cut-off events. For 19960/19960 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10264 event pairs, 513 based on Foata normal form. 1/1832 useless extension candidates. Maximal degree in co-relation 9709. Up to 1088 conditions per place. [2022-12-06 07:13:03,347 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 129 selfloop transitions, 21 changer transitions 7/157 dead transitions. [2022-12-06 07:13:03,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 157 transitions, 2070 flow [2022-12-06 07:13:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:13:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:13:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 07:13:03,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2022-12-06 07:13:03,349 INFO L175 Difference]: Start difference. First operand has 105 places, 114 transitions, 1409 flow. Second operand 6 states and 94 transitions. [2022-12-06 07:13:03,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 157 transitions, 2070 flow [2022-12-06 07:13:03,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 157 transitions, 2026 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:03,431 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1435, PETRI_PLACES=111, PETRI_TRANSITIONS=116} [2022-12-06 07:13:03,431 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 86 predicate places. [2022-12-06 07:13:03,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:03,432 INFO L89 Accepts]: Start accepts. Operand has 111 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:03,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:03,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,496 INFO L130 PetriNetUnfolder]: 107/474 cut-off events. [2022-12-06 07:13:03,497 INFO L131 PetriNetUnfolder]: For 3775/3875 co-relation queries the response was YES. [2022-12-06 07:13:03,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 474 events. 107/474 cut-off events. For 3775/3875 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3574 event pairs, 5 based on Foata normal form. 18/482 useless extension candidates. Maximal degree in co-relation 2132. Up to 84 conditions per place. [2022-12-06 07:13:03,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 07:13:03,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:03,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:13:03,506 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 1435 flow [2022-12-06 07:13:03,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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:03,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:03,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:03,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:13:03,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 783401784, now seen corresponding path program 1 times [2022-12-06 07:13:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30143001] [2022-12-06 07:13:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:03,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30143001] [2022-12-06 07:13:03,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30143001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:03,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171655814] [2022-12-06 07:13:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:03,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:03,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:13:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:04,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:13:04,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:04,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:04,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:04,079 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:13:04,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-06 07:13:04,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 07:13:04,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:13:04,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:04,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:13:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:04,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:04,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171655814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:13:04,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:13:04,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 07:13:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383817452] [2022-12-06 07:13:04,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:13:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:13:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:13:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=195, Unknown=9, NotChecked=0, Total=272 [2022-12-06 07:13:04,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:13:04,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 1435 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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:04,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:04,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:13:04,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:13,997 INFO L130 PetriNetUnfolder]: 1128/2008 cut-off events. [2022-12-06 07:13:13,997 INFO L131 PetriNetUnfolder]: For 21589/21589 co-relation queries the response was YES. [2022-12-06 07:13:14,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11729 conditions, 2008 events. 1128/2008 cut-off events. For 21589/21589 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11563 event pairs, 401 based on Foata normal form. 16/2024 useless extension candidates. Maximal degree in co-relation 11592. Up to 1015 conditions per place. [2022-12-06 07:13:14,007 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 176 selfloop transitions, 41 changer transitions 5/222 dead transitions. [2022-12-06 07:13:14,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 222 transitions, 2827 flow [2022-12-06 07:13:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:13:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:13:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 145 transitions. [2022-12-06 07:13:14,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27884615384615385 [2022-12-06 07:13:14,009 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 1435 flow. Second operand 13 states and 145 transitions. [2022-12-06 07:13:14,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 222 transitions, 2827 flow [2022-12-06 07:13:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 222 transitions, 2787 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 07:13:14,049 INFO L231 Difference]: Finished difference. Result has 126 places, 138 transitions, 1792 flow [2022-12-06 07:13:14,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1792, PETRI_PLACES=126, PETRI_TRANSITIONS=138} [2022-12-06 07:13:14,050 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 101 predicate places. [2022-12-06 07:13:14,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:14,050 INFO L89 Accepts]: Start accepts. Operand has 126 places, 138 transitions, 1792 flow [2022-12-06 07:13:14,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:14,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:14,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 138 transitions, 1792 flow [2022-12-06 07:13:14,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 138 transitions, 1792 flow [2022-12-06 07:13:14,100 INFO L130 PetriNetUnfolder]: 124/545 cut-off events. [2022-12-06 07:13:14,100 INFO L131 PetriNetUnfolder]: For 4810/4907 co-relation queries the response was YES. [2022-12-06 07:13:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 545 events. 124/545 cut-off events. For 4810/4907 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4208 event pairs, 7 based on Foata normal form. 17/556 useless extension candidates. Maximal degree in co-relation 2499. Up to 99 conditions per place. [2022-12-06 07:13:14,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 138 transitions, 1792 flow [2022-12-06 07:13:14,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 794 [2022-12-06 07:13:14,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L51-1-->L51-3: Formula: (and (= (select (select |v_#memory_int_65| v_~a2~0.base_19) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_37| 4) v_~a2~0.offset_19)) |v_thread1Thread1of1ForFork0_#t~mem2#1_23|) (not (= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| |v_thread1Thread1of1ForFork0_#t~mem2#1_23|))) InVars {~a2~0.base=v_~a2~0.base_19, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|, #memory_int=|v_#memory_int_65|, ~a2~0.offset=v_~a2~0.offset_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|} OutVars{~a2~0.base=v_~a2~0.base_19, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_37|, #memory_int=|v_#memory_int_65|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_23|, ~a2~0.offset=v_~a2~0.offset_19, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:14,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_25| v_~n1~0_12) (= (select (select |v_#memory_int_33| v_~a1~0.base_9) (+ v_~a1~0.offset_9 (* |v_thread1Thread1of1ForFork0_~i~0#1_25| 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_25| v_~n2~0_12)) InVars {~n2~0=v_~n2~0_12, ~n1~0=v_~n1~0_12, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_25|, ~a1~0.offset=v_~a1~0.offset_9, #memory_int=|v_#memory_int_33|, ~a1~0.base=v_~a1~0.base_9} OutVars{~n2~0=v_~n2~0_12, ~n1~0=v_~n1~0_12, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_25|, ~a1~0.offset=v_~a1~0.offset_9, #memory_int=|v_#memory_int_33|, ~a1~0.base=v_~a1~0.base_9, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:14,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_25| v_~n1~0_12) (= (select (select |v_#memory_int_33| v_~a1~0.base_9) (+ v_~a1~0.offset_9 (* |v_thread1Thread1of1ForFork0_~i~0#1_25| 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_13|) (< |v_thread1Thread1of1ForFork0_~i~0#1_25| v_~n2~0_12)) InVars {~n2~0=v_~n2~0_12, ~n1~0=v_~n1~0_12, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_25|, ~a1~0.offset=v_~a1~0.offset_9, #memory_int=|v_#memory_int_33|, ~a1~0.base=v_~a1~0.base_9} OutVars{~n2~0=v_~n2~0_12, ~n1~0=v_~n1~0_12, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_25|, ~a1~0.offset=v_~a1~0.offset_9, #memory_int=|v_#memory_int_33|, ~a1~0.base=v_~a1~0.base_9, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:14,267 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:13:14,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 07:13:14,269 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 136 transitions, 1797 flow [2022-12-06 07:13:14,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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:14,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:14,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:14,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:13:14,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:13:14,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 296104767, now seen corresponding path program 1 times [2022-12-06 07:13:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899245717] [2022-12-06 07:13:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:15,110 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:15,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:15,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899245717] [2022-12-06 07:13:15,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899245717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:15,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:15,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:13:15,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998489143] [2022-12-06 07:13:15,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:15,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:13:15,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:15,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:13:15,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:13:15,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:13:15,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 136 transitions, 1797 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:15,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:15,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:13:15,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:15,782 INFO L130 PetriNetUnfolder]: 1369/2439 cut-off events. [2022-12-06 07:13:15,782 INFO L131 PetriNetUnfolder]: For 29397/29397 co-relation queries the response was YES. [2022-12-06 07:13:15,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15015 conditions, 2439 events. 1369/2439 cut-off events. For 29397/29397 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14626 event pairs, 661 based on Foata normal form. 1/2440 useless extension candidates. Maximal degree in co-relation 13960. Up to 1086 conditions per place. [2022-12-06 07:13:15,804 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 175 selfloop transitions, 32 changer transitions 7/214 dead transitions. [2022-12-06 07:13:15,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 214 transitions, 3041 flow [2022-12-06 07:13:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:13:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:13:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 07:13:15,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36038961038961037 [2022-12-06 07:13:15,806 INFO L175 Difference]: Start difference. First operand has 124 places, 136 transitions, 1797 flow. Second operand 7 states and 111 transitions. [2022-12-06 07:13:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 214 transitions, 3041 flow [2022-12-06 07:13:15,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 214 transitions, 2917 flow, removed 62 selfloop flow, removed 1 redundant places. [2022-12-06 07:13:15,911 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 1946 flow [2022-12-06 07:13:15,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1946, PETRI_PLACES=134, PETRI_TRANSITIONS=145} [2022-12-06 07:13:15,912 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 109 predicate places. [2022-12-06 07:13:15,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:15,912 INFO L89 Accepts]: Start accepts. Operand has 134 places, 145 transitions, 1946 flow [2022-12-06 07:13:15,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:15,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:15,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 145 transitions, 1946 flow [2022-12-06 07:13:15,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 145 transitions, 1946 flow [2022-12-06 07:13:15,991 INFO L130 PetriNetUnfolder]: 143/636 cut-off events. [2022-12-06 07:13:15,991 INFO L131 PetriNetUnfolder]: For 6249/6340 co-relation queries the response was YES. [2022-12-06 07:13:15,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 636 events. 143/636 cut-off events. For 6249/6340 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5203 event pairs, 12 based on Foata normal form. 19/647 useless extension candidates. Maximal degree in co-relation 3187. Up to 125 conditions per place. [2022-12-06 07:13:16,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 145 transitions, 1946 flow [2022-12-06 07:13:16,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 842 [2022-12-06 07:13:16,002 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:16,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 07:13:16,004 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 145 transitions, 1946 flow [2022-12-06 07:13:16,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:16,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:16,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:16,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:13:16,005 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash -195835071, now seen corresponding path program 2 times [2022-12-06 07:13:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:16,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206744858] [2022-12-06 07:13:16,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:16,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:16,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206744858] [2022-12-06 07:13:16,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206744858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:16,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029019376] [2022-12-06 07:13:16,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:13:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:13:16,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:13:16,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:13:16,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:13:16,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:13:16,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 07:13:16,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:13:16,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:16,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:16,548 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-06 07:13:16,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 94 [2022-12-06 07:13:16,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-06 07:13:16,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-06 07:13:16,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:16,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-12-06 07:13:16,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 07:13:16,581 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:13:16,581 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2022-12-06 07:13:16,678 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~a2~0.base 2)) (.cse1 (+ 2 c_~a1~0.base))) (and (< 0 c_~n1~0) (or (= c_~a2~0.base c_~a1~0.base) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| Int)) (and (<= .cse0 |ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse2 (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| c_~a1~0.base v_DerPreprocessor_4) c_~a2~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| .cse3) c_~a1~0.base v_DerPreprocessor_4) c_~a2~0.base v_DerPreprocessor_5) |ULTIMATE.start_main_~#t1~0#1.base| .cse3)))) (and (= (select .cse2 c_~a1~0.base) (select |c_#memory_int| c_~a1~0.base)) (= (select (select |c_#memory_int| c_~a2~0.base) c_~a2~0.offset) (select (select .cse2 c_~a2~0.base) c_~a2~0.offset)))))))) (= c_~a2~0.offset 0) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 c_~n2~0) (= c_~a1~0.offset 0))) is different from true [2022-12-06 07:13:16,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:16,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:13:16,793 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-06 07:13:16,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 113 [2022-12-06 07:13:16,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 07:13:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:13:16,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:13:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:13:17,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029019376] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:13:17,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:13:17,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2022-12-06 07:13:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226048011] [2022-12-06 07:13:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:17,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:13:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:13:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=186, Unknown=3, NotChecked=28, Total=272 [2022-12-06 07:13:17,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:13:17,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 145 transitions, 1946 flow. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:17,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:17,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:13:17,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:17,825 INFO L130 PetriNetUnfolder]: 1466/2628 cut-off events. [2022-12-06 07:13:17,825 INFO L131 PetriNetUnfolder]: For 32810/32810 co-relation queries the response was YES. [2022-12-06 07:13:17,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16267 conditions, 2628 events. 1466/2628 cut-off events. For 32810/32810 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16192 event pairs, 789 based on Foata normal form. 18/2645 useless extension candidates. Maximal degree in co-relation 16084. Up to 2344 conditions per place. [2022-12-06 07:13:17,842 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 168 selfloop transitions, 20 changer transitions 3/191 dead transitions. [2022-12-06 07:13:17,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 191 transitions, 2775 flow [2022-12-06 07:13:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:13:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:13:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-12-06 07:13:17,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26136363636363635 [2022-12-06 07:13:17,844 INFO L175 Difference]: Start difference. First operand has 133 places, 145 transitions, 1946 flow. Second operand 8 states and 92 transitions. [2022-12-06 07:13:17,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 191 transitions, 2775 flow [2022-12-06 07:13:17,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 191 transitions, 2745 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 07:13:17,936 INFO L231 Difference]: Finished difference. Result has 143 places, 153 transitions, 2160 flow [2022-12-06 07:13:17,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2160, PETRI_PLACES=143, PETRI_TRANSITIONS=153} [2022-12-06 07:13:17,937 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 118 predicate places. [2022-12-06 07:13:17,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:17,937 INFO L89 Accepts]: Start accepts. Operand has 143 places, 153 transitions, 2160 flow [2022-12-06 07:13:17,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:17,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:17,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 153 transitions, 2160 flow [2022-12-06 07:13:17,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 153 transitions, 2160 flow [2022-12-06 07:13:18,001 INFO L130 PetriNetUnfolder]: 148/679 cut-off events. [2022-12-06 07:13:18,001 INFO L131 PetriNetUnfolder]: For 6495/6618 co-relation queries the response was YES. [2022-12-06 07:13:18,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 679 events. 148/679 cut-off events. For 6495/6618 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5701 event pairs, 10 based on Foata normal form. 16/686 useless extension candidates. Maximal degree in co-relation 3176. Up to 123 conditions per place. [2022-12-06 07:13:18,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 153 transitions, 2160 flow [2022-12-06 07:13:18,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-06 07:13:18,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:18,063 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] L50-2-->L52-1: Formula: (let ((.cse0 (* |v_thread1Thread1of1ForFork0_~i~0#1_195| 4))) (let ((.cse1 (select (select |v_#memory_int_373| v_~a1~0.base_150) (+ v_~a1~0.offset_150 .cse0)))) (and (not (= (select (select |v_#memory_int_373| v_~a2~0.base_195) (+ v_~a2~0.offset_195 .cse0)) .cse1)) (< |v_thread1Thread1of1ForFork0_~i~0#1_195| v_~n1~0_130) (= |v_thread1Thread1of1ForFork0_#t~mem3#1_104| .cse1) (< |v_thread1Thread1of1ForFork0_~i~0#1_195| v_~n2~0_136)))) InVars {~a2~0.base=v_~a2~0.base_195, ~n2~0=v_~n2~0_136, ~n1~0=v_~n1~0_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, ~a1~0.offset=v_~a1~0.offset_150, #memory_int=|v_#memory_int_373|, ~a1~0.base=v_~a1~0.base_150, ~a2~0.offset=v_~a2~0.offset_195} OutVars{~a2~0.base=v_~a2~0.base_195, ~n2~0=v_~n2~0_136, ~n1~0=v_~n1~0_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, ~a1~0.offset=v_~a1~0.offset_150, #memory_int=|v_#memory_int_373|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_108|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_104|, ~a1~0.base=v_~a1~0.base_150, ~a2~0.offset=v_~a2~0.offset_195, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:18,102 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:13:18,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:13:18,103 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 153 transitions, 2205 flow [2022-12-06 07:13:18,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:18,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:18,103 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:18,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:13:18,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:13:18,304 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -630952765, now seen corresponding path program 1 times [2022-12-06 07:13:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107306302] [2022-12-06 07:13:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:18,354 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:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107306302] [2022-12-06 07:13:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107306302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:18,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:18,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:13:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375406084] [2022-12-06 07:13:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:13:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:13:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:13:18,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:13:18,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 153 transitions, 2205 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:18,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:18,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:13:18,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:18,742 INFO L130 PetriNetUnfolder]: 1425/2554 cut-off events. [2022-12-06 07:13:18,743 INFO L131 PetriNetUnfolder]: For 33265/33265 co-relation queries the response was YES. [2022-12-06 07:13:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16007 conditions, 2554 events. 1425/2554 cut-off events. For 33265/33265 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 15537 event pairs, 795 based on Foata normal form. 8/2561 useless extension candidates. Maximal degree in co-relation 14781. Up to 2509 conditions per place. [2022-12-06 07:13:18,760 INFO L137 encePairwiseOnDemand]: 44/47 looper letters, 146 selfloop transitions, 0 changer transitions 15/161 dead transitions. [2022-12-06 07:13:18,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 2557 flow [2022-12-06 07:13:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:13:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:13:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 07:13:18,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3191489361702128 [2022-12-06 07:13:18,761 INFO L175 Difference]: Start difference. First operand has 143 places, 153 transitions, 2205 flow. Second operand 4 states and 60 transitions. [2022-12-06 07:13:18,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 2557 flow [2022-12-06 07:13:18,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 161 transitions, 2460 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-12-06 07:13:18,846 INFO L231 Difference]: Finished difference. Result has 142 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2053, PETRI_PLACES=142, PETRI_TRANSITIONS=146} [2022-12-06 07:13:18,847 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 117 predicate places. [2022-12-06 07:13:18,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:18,847 INFO L89 Accepts]: Start accepts. Operand has 142 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:18,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:18,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,905 INFO L130 PetriNetUnfolder]: 147/655 cut-off events. [2022-12-06 07:13:18,906 INFO L131 PetriNetUnfolder]: For 6120/6241 co-relation queries the response was YES. [2022-12-06 07:13:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 655 events. 147/655 cut-off events. For 6120/6241 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5398 event pairs, 11 based on Foata normal form. 16/664 useless extension candidates. Maximal degree in co-relation 3103. Up to 124 conditions per place. [2022-12-06 07:13:18,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 07:13:18,912 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:13:18,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 07:13:18,913 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 146 transitions, 2053 flow [2022-12-06 07:13:18,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:13:18,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:13:18,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:13:18,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:13:18,913 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:13:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:13:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1564808903, now seen corresponding path program 1 times [2022-12-06 07:13:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:13:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791388405] [2022-12-06 07:13:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:13:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:13:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:13:19,402 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:19,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:13:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791388405] [2022-12-06 07:13:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791388405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:13:19,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:13:19,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:13:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619686714] [2022-12-06 07:13:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:13:19,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:13:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:13:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:13:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:13:19,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:13:19,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 146 transitions, 2053 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:19,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:13:19,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:13:19,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:13:20,225 INFO L130 PetriNetUnfolder]: 1424/2555 cut-off events. [2022-12-06 07:13:20,225 INFO L131 PetriNetUnfolder]: For 31781/31781 co-relation queries the response was YES. [2022-12-06 07:13:20,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15819 conditions, 2555 events. 1424/2555 cut-off events. For 31781/31781 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15639 event pairs, 782 based on Foata normal form. 10/2564 useless extension candidates. Maximal degree in co-relation 14669. Up to 2010 conditions per place. [2022-12-06 07:13:20,241 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 183 selfloop transitions, 9 changer transitions 12/204 dead transitions. [2022-12-06 07:13:20,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 204 transitions, 2922 flow [2022-12-06 07:13:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:13:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:13:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2022-12-06 07:13:20,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-06 07:13:20,242 INFO L175 Difference]: Start difference. First operand has 134 places, 146 transitions, 2053 flow. Second operand 8 states and 108 transitions. [2022-12-06 07:13:20,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 204 transitions, 2922 flow [2022-12-06 07:13:20,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 204 transitions, 2817 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-12-06 07:13:20,314 INFO L231 Difference]: Finished difference. Result has 140 places, 145 transitions, 1999 flow [2022-12-06 07:13:20,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1999, PETRI_PLACES=140, PETRI_TRANSITIONS=145} [2022-12-06 07:13:20,315 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2022-12-06 07:13:20,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:13:20,315 INFO L89 Accepts]: Start accepts. Operand has 140 places, 145 transitions, 1999 flow [2022-12-06 07:13:20,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:13:20,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:13:20,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 145 transitions, 1999 flow [2022-12-06 07:13:20,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 145 transitions, 1999 flow [2022-12-06 07:13:20,373 INFO L130 PetriNetUnfolder]: 146/652 cut-off events. [2022-12-06 07:13:20,374 INFO L131 PetriNetUnfolder]: For 6181/6320 co-relation queries the response was YES. [2022-12-06 07:13:20,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 652 events. 146/652 cut-off events. For 6181/6320 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5367 event pairs, 11 based on Foata normal form. 18/662 useless extension candidates. Maximal degree in co-relation 3128. Up to 123 conditions per place. [2022-12-06 07:13:20,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 145 transitions, 1999 flow [2022-12-06 07:13:20,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-06 07:13:20,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] $Ultimate##0-->L50-2: Formula: (and (= (+ v_~n2~0_16 v_~res1~0_13) v_~n1~0_22) (= |v_thread1Thread1of1ForFork0_~i~0#1_29| 0)) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22} OutVars{~res1~0=v_~res1~0_13, ~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_29|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:20,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [911] L64-2-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_329| v_~a2~0.base_173))) (and (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_76|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_74| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_76|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (= (select .cse0 (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_177| 4) v_~a2~0.offset_173)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_52|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_74| |v_thread1Thread1of1ForFork0_minus_#in~a#1_44|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_76| |v_thread1Thread1of1ForFork0_minus_#in~b#1_52|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_62| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_62|)) (= v_~res1~0_108 |v_thread1Thread1of1ForFork0_minus_#res#1_62|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_44| |v_thread1Thread1of1ForFork0_#t~mem3#1_97|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_37| 0) (let ((.cse5 (< |v_thread2Thread1of1ForFork1_~i~1#1_90| v_~n2~0_122)) (.cse3 (< |v_thread2Thread1of1ForFork1_~i~1#1_90| v_~n1~0_116)) (.cse2 (= |v_thread2Thread1of1ForFork1_#res#1.offset_39| 0)) (.cse4 (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_39|))) (or (let ((.cse7 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_90|))) (let ((.cse1 (select (select |v_#memory_int_329| v_~a1~0.base_128) (+ .cse7 v_~a1~0.offset_128))) (.cse6 (select .cse0 (+ .cse7 v_~a2~0.offset_173)))) (and (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_81| |v_thread2Thread1of1ForFork1_minus_#res#1_61|)) (<= 0 (+ v_~res2~0_113 2147483648)) (= .cse1 |v_thread2Thread1of1ForFork1_minus_#in~b#1_51|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_81| |v_thread2Thread1of1ForFork1_minus_#in~b#1_51|) .cse2 .cse3 .cse4 (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_81|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_81|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) .cse5 (= |v_thread2Thread1of1ForFork1_minus_#res#1_61| v_~res2~0_113) (not (= .cse6 .cse1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= .cse6 |v_thread2Thread1of1ForFork1_minus_#in~a#1_51|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| |v_thread2Thread1of1ForFork1_minus_#in~a#1_51|) (<= v_~res2~0_113 2147483647)))) (and (= v_~res2~0_114 v_~res2~0_113) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_52| |v_thread2Thread1of1ForFork1_minus_#in~b#1_51|) (or (not .cse5) (not .cse3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91|) (= |v_thread2Thread1of1ForFork1_#t~mem7#1_68| |v_thread2Thread1of1ForFork1_#t~mem7#1_67|) .cse2 .cse4 (= |v_thread2Thread1of1ForFork1_#t~ret11#1_58| |v_thread2Thread1of1ForFork1_#t~ret11#1_57|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_52| |v_thread2Thread1of1ForFork1_minus_#in~a#1_51|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_82| |v_thread2Thread1of1ForFork1_minus_~b#1_81|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= |v_thread2Thread1of1ForFork1_#t~mem10#1_59| |v_thread2Thread1of1ForFork1_#t~mem10#1_60|) (= |v_thread2Thread1of1ForFork1_#t~mem9#1_62| |v_thread2Thread1of1ForFork1_#t~mem9#1_61|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_62| |v_thread2Thread1of1ForFork1_minus_#res#1_61|) (= |v_thread2Thread1of1ForFork1_#t~mem8#1_68| |v_thread2Thread1of1ForFork1_#t~mem8#1_67|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_80| |v_thread2Thread1of1ForFork1_minus_~a#1_79|)))) (= |v_thread1Thread1of1ForFork0_#res#1.base_37| 0) (= |v_thread1Thread1of1ForFork0_minus_~a#1_74| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_76| |v_thread1Thread1of1ForFork0_minus_#res#1_62|)))) InVars {thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_68|, ~n2~0=v_~n2~0_122, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_58|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_82|, ~n1~0=v_~n1~0_116, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_90|, ~a1~0.base=v_~a1~0.base_128, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_80|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, ~a2~0.base=v_~a2~0.base_173, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_68|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_52|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_177|, #memory_int=|v_#memory_int_329|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_60|, ~a1~0.offset=v_~a1~0.offset_128, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_52|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_97|, ~a2~0.offset=v_~a2~0.offset_173, ~res2~0=v_~res2~0_114} OutVars{~res1~0=v_~res1~0_108, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_67|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_44|, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_57|, ~n1~0=v_~n1~0_116, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_39|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_90|, ~a1~0.base=v_~a1~0.base_128, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_79|, ~a2~0.base=v_~a2~0.base_173, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_61|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_51|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_59|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_51|, ~a2~0.offset=v_~a2~0.offset_173, ~res2~0=v_~res2~0_113, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_37|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_62|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_37|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_60|, ~n2~0=v_~n2~0_122, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_81|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_39|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_67|, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_56|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_76|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_177|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_74|, #memory_int=|v_#memory_int_329|, ~a1~0.offset=v_~a1~0.offset_128} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#t~mem3#1, ~res2~0, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:20,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L52-1-->thread1EXIT: Formula: (and (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_45|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_45|) |v_thread1Thread1of1ForFork0_minus_~a#1_59|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= v_~res1~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_45|) (= (select (select |v_#memory_int_211| v_~a2~0.base_107) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_93| 4) v_~a2~0.offset_107)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_37|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_59| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_45| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_59| |v_thread1Thread1of1ForFork0_minus_#in~a#1_29|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_29| |v_thread1Thread1of1ForFork0_#t~mem3#1_54|)) InVars {~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_54|, ~a2~0.offset=v_~a2~0.offset_107} OutVars{~res1~0=v_~res1~0_73, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_45|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_43|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_37|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, ~a2~0.base=v_~a2~0.base_107, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_41|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_93|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_61|, #memory_int=|v_#memory_int_211|, ~a2~0.offset=v_~a2~0.offset_107, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base] and [741] L84-4-->L85-3: Formula: (and (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre19#1_21|))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_24|)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} 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:21,788 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:13:21,791 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:13:21,791 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:13:21,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:13:21,792 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 contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) 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:21,794 INFO L158 Benchmark]: Toolchain (without parser) took 54158.65ms. Allocated memory was 203.4MB in the beginning and 697.3MB in the end (delta: 493.9MB). Free memory was 178.7MB in the beginning and 254.5MB in the end (delta: -75.8MB). Peak memory consumption was 419.6MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,794 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 179.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:13:21,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.41ms. Allocated memory is still 203.4MB. Free memory was 178.7MB in the beginning and 166.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.65ms. Allocated memory is still 203.4MB. Free memory was 166.5MB in the beginning and 164.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,795 INFO L158 Benchmark]: Boogie Preprocessor took 42.96ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,795 INFO L158 Benchmark]: RCFGBuilder took 549.12ms. Allocated memory is still 203.4MB. Free memory was 162.5MB in the beginning and 142.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,795 INFO L158 Benchmark]: TraceAbstraction took 53303.20ms. Allocated memory was 203.4MB in the beginning and 697.3MB in the end (delta: 493.9MB). Free memory was 142.0MB in the beginning and 254.5MB in the end (delta: -112.5MB). Peak memory consumption was 382.9MB. Max. memory is 8.0GB. [2022-12-06 07:13:21,796 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.10ms. Allocated memory is still 203.4MB. Free memory is still 179.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.41ms. Allocated memory is still 203.4MB. Free memory was 178.7MB in the beginning and 166.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.65ms. Allocated memory is still 203.4MB. Free memory was 166.5MB in the beginning and 164.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.96ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 549.12ms. Allocated memory is still 203.4MB. Free memory was 162.5MB in the beginning and 142.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 53303.20ms. Allocated memory was 203.4MB in the beginning and 697.3MB in the end (delta: 493.9MB). Free memory was 142.0MB in the beginning and 254.5MB in the end (delta: -112.5MB). Peak memory consumption was 382.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 203 PlacesBefore, 25 PlacesAfterwards, 217 TransitionsBefore, 23 TransitionsAfterwards, 5192 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 100 TrivialYvCompositions, 78 ConcurrentYvCompositions, 16 ChoiceCompositions, 194 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3443, independent: 3410, independent conditional: 3410, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3443, independent: 3410, independent conditional: 0, independent unconditional: 3410, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3443, independent: 3410, independent conditional: 0, independent unconditional: 3410, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3443, independent: 3410, independent conditional: 0, independent unconditional: 3410, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3113, independent: 3095, independent conditional: 0, independent unconditional: 3095, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3113, independent: 3095, independent conditional: 0, independent unconditional: 3095, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3443, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3113, unknown conditional: 0, unknown unconditional: 3113] , Statistics on independence cache: Total cache size (in pairs): 6195, Positive cache size: 6177, Positive conditional cache size: 0, Positive unconditional cache size: 6177, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 34 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 90, independent conditional: 18, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 90, independent conditional: 18, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 90, independent conditional: 18, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 30, independent conditional: 6, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 60, independent conditional: 12, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 36, unknown conditional: 6, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 6, Positive unconditional cache size: 24, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 40 PlacesBefore, 40 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 110, independent: 88, independent conditional: 44, independent unconditional: 44, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 30, Positive conditional cache size: 6, Positive unconditional cache size: 24, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 148, independent: 124, independent conditional: 52, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 124, independent conditional: 51, independent unconditional: 73, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 124, independent conditional: 51, independent unconditional: 73, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 148, independent: 114, independent conditional: 48, independent unconditional: 66, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 40, Positive conditional cache size: 9, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 172, independent conditional: 172, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 172, independent conditional: 76, independent unconditional: 96, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 172, independent conditional: 75, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 172, independent conditional: 75, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 169, independent conditional: 72, independent unconditional: 97, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 43, Positive conditional cache size: 12, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 154, independent conditional: 154, 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: 180, independent: 154, independent conditional: 82, independent unconditional: 72, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 154, independent conditional: 78, independent unconditional: 76, 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: 180, independent: 154, independent conditional: 78, independent unconditional: 76, 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: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 147, independent conditional: 72, independent unconditional: 75, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 50, Positive conditional cache size: 18, Positive unconditional cache size: 32, 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: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 72, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 50, Positive conditional cache size: 18, Positive unconditional cache size: 32, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 50, Positive conditional cache size: 18, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 73 PlacesBefore, 68 PlacesAfterwards, 60 TransitionsBefore, 55 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 38, independent conditional: 36, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 36, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 38, independent conditional: 36, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 110, Positive conditional cache size: 28, Positive unconditional cache size: 82, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 68 PlacesBefore, 68 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 42, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 140, Positive conditional cache size: 42, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 140, Positive conditional cache size: 42, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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, 71 PlacesBefore, 71 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 140, Positive conditional cache size: 42, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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: 7.0s, 81 PlacesBefore, 81 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 22, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 149, Positive conditional cache size: 51, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 152, Positive conditional cache size: 54, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 152, Positive conditional cache size: 54, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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, 105 PlacesBefore, 105 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 152, Positive conditional cache size: 54, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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, 110 PlacesBefore, 110 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 152, Positive conditional cache size: 54, Positive unconditional cache size: 98, Negative cache size: 8, Negative conditional cache size: 1, 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, 126 PlacesBefore, 124 PlacesAfterwards, 138 TransitionsBefore, 136 TransitionsAfterwards, 794 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 173, Positive conditional cache size: 57, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 1, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 173, Positive conditional cache size: 57, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 1, 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, 143 PlacesBefore, 143 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 174, Positive conditional cache size: 58, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 1, 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, 134 PlacesBefore, 134 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 174, Positive conditional cache size: 58, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 1, 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: 1.4s, 137 PlacesBefore, 134 PlacesAfterwards, 145 TransitionsBefore, 140 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 17, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 178, Positive conditional cache size: 62, Positive unconditional cache size: 116, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:13:21,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...