/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:52:30,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:52:30,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:52:30,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:52:30,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:52:30,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:52:30,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:52:30,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:52:30,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:52:30,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:52:30,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:52:30,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:52:30,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:52:30,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:52:30,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:52:30,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:52:30,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:52:30,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:52:30,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:52:30,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:52:30,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:52:30,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:52:30,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:52:30,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:52:30,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:52:30,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:52:30,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:52:30,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:52:30,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:52:30,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:52:30,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:52:30,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:52:30,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:52:30,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:52:30,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:52:30,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:52:30,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:52:30,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:52:30,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:52:30,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:52:30,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:52:30,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:52:30,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:52:30,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:52:30,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:52:30,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:52:30,183 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:52:30,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:52:30,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:52:30,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:52:30,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:52:30,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:52:30,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:52:30,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:52:30,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:52:30,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:52:30,186 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-05 23:52:30,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:52:30,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:52:30,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:52:30,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:52:30,462 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:52:30,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2022-12-05 23:52:31,443 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:52:31,660 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:52:31,661 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2022-12-05 23:52:31,669 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38462b428/08e660a63a18475d85a6798fbe8d6a44/FLAG13ed24f65 [2022-12-05 23:52:31,682 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38462b428/08e660a63a18475d85a6798fbe8d6a44 [2022-12-05 23:52:31,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:52:31,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:52:31,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:52:31,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:52:31,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:52:31,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8cef85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31, skipping insertion in model container [2022-12-05 23:52:31,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:52:31,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:52:31,859 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-name-comparator-symm.wvr.c[3856,3869] [2022-12-05 23:52:31,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:52:31,874 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:52:31,904 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-name-comparator-symm.wvr.c[3856,3869] [2022-12-05 23:52:31,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:52:31,917 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:52:31,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31 WrapperNode [2022-12-05 23:52:31,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:52:31,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:52:31,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:52:31,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:52:31,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,963 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 214 [2022-12-05 23:52:31,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:52:31,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:52:31,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:52:31,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:52:31,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:31,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:32,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:32,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:32,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:52:32,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:52:32,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:52:32,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:52:32,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (1/1) ... [2022-12-05 23:52:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:52:32,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:52:32,024 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-05 23:52:32,050 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-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 23:52:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 23:52:32,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:52:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 23:52:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:52:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:52:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:52:32,064 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:52:32,142 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:52:32,143 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:52:32,380 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:52:32,387 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:52:32,387 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 23:52:32,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:52:32 BoogieIcfgContainer [2022-12-05 23:52:32,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:52:32,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:52:32,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:52:32,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:52:32,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:52:31" (1/3) ... [2022-12-05 23:52:32,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562db042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:52:32, skipping insertion in model container [2022-12-05 23:52:32,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:52:31" (2/3) ... [2022-12-05 23:52:32,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562db042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:52:32, skipping insertion in model container [2022-12-05 23:52:32,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:52:32" (3/3) ... [2022-12-05 23:52:32,393 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2022-12-05 23:52:32,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:52:32,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:52:32,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:52:32,475 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:52:32,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 247 transitions, 510 flow [2022-12-05 23:52:32,584 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2022-12-05 23:52:32,584 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:52:32,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 245 events. 19/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2022-12-05 23:52:32,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 247 transitions, 510 flow [2022-12-05 23:52:32,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 237 transitions, 486 flow [2022-12-05 23:52:32,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:32,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 237 transitions, 486 flow [2022-12-05 23:52:32,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 237 transitions, 486 flow [2022-12-05 23:52:32,684 INFO L130 PetriNetUnfolder]: 19/237 cut-off events. [2022-12-05 23:52:32,685 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:52:32,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 237 events. 19/237 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 442 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2022-12-05 23:52:32,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 237 transitions, 486 flow [2022-12-05 23:52:32,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 9548 [2022-12-05 23:52:40,557 INFO L203 LiptonReduction]: Total number of compositions: 220 [2022-12-05 23:52:40,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:52:40,581 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;@1f7153c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:52:40,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 23:52:40,584 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 23:52:40,584 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:52:40,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:40,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:40,585 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-05 23:52:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -177987541, now seen corresponding path program 1 times [2022-12-05 23:52:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353636140] [2022-12-05 23:52:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:40,932 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-05 23:52:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353636140] [2022-12-05 23:52:40,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353636140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:40,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:40,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430757494] [2022-12-05 23:52:40,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:40,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:40,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:40,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:52:40,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:40,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:40,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:52:40,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:41,011 INFO L130 PetriNetUnfolder]: 41/76 cut-off events. [2022-12-05 23:52:41,011 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:52:41,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 76 events. 41/76 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 24 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-05 23:52:41,013 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 16 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-05 23:52:41,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 84 flow [2022-12-05 23:52:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-05 23:52:41,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-05 23:52:41,022 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 19 transitions. [2022-12-05 23:52:41,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 84 flow [2022-12-05 23:52:41,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 76 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:52:41,025 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:41,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-05 23:52:41,029 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-05 23:52:41,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:41,030 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:41,031 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:41,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:41,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:41,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:41,036 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-05 23:52:41,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:41,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-05 23:52:41,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:41,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-05 23:52:42,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:42,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1211 [2022-12-05 23:52:42,240 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-05 23:52:42,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:42,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:42,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:42,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:52:42,241 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-05 23:52:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1844923589, now seen corresponding path program 1 times [2022-12-05 23:52:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220296411] [2022-12-05 23:52:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:42,361 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-05 23:52:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220296411] [2022-12-05 23:52:42,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220296411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:42,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:42,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58862543] [2022-12-05 23:52:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:42,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:42,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:52:42,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:42,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:42,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:52:42,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:42,404 INFO L130 PetriNetUnfolder]: 41/76 cut-off events. [2022-12-05 23:52:42,404 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:52:42,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 76 events. 41/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 24 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 157. Up to 76 conditions per place. [2022-12-05 23:52:42,405 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 16 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-05 23:52:42,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 86 flow [2022-12-05 23:52:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-05 23:52:42,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-05 23:52:42,406 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 19 transitions. [2022-12-05 23:52:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 86 flow [2022-12-05 23:52:42,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 76 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:42,407 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:42,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-05 23:52:42,408 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-05 23:52:42,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:42,408 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:42,409 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:42,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:42,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:42,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:42,412 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-05 23:52:42,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:42,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-05 23:52:42,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:42,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-05 23:52:43,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:43,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1130 [2022-12-05 23:52:43,538 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-05 23:52:43,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:43,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:43,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:43,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:52:43,539 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-05 23:52:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1944485082, now seen corresponding path program 1 times [2022-12-05 23:52:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:43,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198400772] [2022-12-05 23:52:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:43,579 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-05 23:52:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198400772] [2022-12-05 23:52:43,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198400772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:43,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:43,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:52:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910460718] [2022-12-05 23:52:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:52:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:43,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:52:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:52:43,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:52:43,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:43,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:43,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:52:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:43,608 INFO L130 PetriNetUnfolder]: 41/76 cut-off events. [2022-12-05 23:52:43,609 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:52:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 76 events. 41/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 24 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 157. Up to 76 conditions per place. [2022-12-05 23:52:43,609 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 16 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-05 23:52:43,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 86 flow [2022-12-05 23:52:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:52:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:52:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-12-05 23:52:43,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-05 23:52:43,610 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 19 transitions. [2022-12-05 23:52:43,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 86 flow [2022-12-05 23:52:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 76 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:43,611 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:43,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-05 23:52:43,611 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-05 23:52:43,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:43,611 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:43,612 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:43,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:43,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:43,614 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-05 23:52:43,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:52:43,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-05 23:52:43,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-05 23:52:43,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-05 23:52:44,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:44,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1205 [2022-12-05 23:52:44,816 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-05 23:52:44,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-05 23:52:44,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:44,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:44,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:52:44,817 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-05 23:52:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926457, now seen corresponding path program 1 times [2022-12-05 23:52:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790930199] [2022-12-05 23:52:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:45,064 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-05 23:52:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:45,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790930199] [2022-12-05 23:52:45,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790930199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:45,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:45,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:52:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399904544] [2022-12-05 23:52:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:52:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:52:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:52:45,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:52:45,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 6 states, 5 states have (on average 2.8) 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-05 23:52:45,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:45,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:52:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:45,172 INFO L130 PetriNetUnfolder]: 71/138 cut-off events. [2022-12-05 23:52:45,172 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:52:45,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 138 events. 71/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 400 event pairs, 24 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 282. Up to 76 conditions per place. [2022-12-05 23:52:45,173 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 3 changer transitions 8/40 dead transitions. [2022-12-05 23:52:45,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 40 transitions, 178 flow [2022-12-05 23:52:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:52:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:52:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-05 23:52:45,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49411764705882355 [2022-12-05 23:52:45,174 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 42 transitions. [2022-12-05 23:52:45,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 40 transitions, 178 flow [2022-12-05 23:52:45,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 40 transitions, 170 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:45,175 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 62 flow [2022-12-05 23:52:45,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-05 23:52:45,175 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-05 23:52:45,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:45,176 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 62 flow [2022-12-05 23:52:45,176 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:45,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:45,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 62 flow [2022-12-05 23:52:45,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 62 flow [2022-12-05 23:52:45,179 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-05 23:52:45,179 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-12-05 23:52:45,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 26 events. 3/26 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 35. Up to 6 conditions per place. [2022-12-05 23:52:45,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 62 flow [2022-12-05 23:52:45,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-05 23:52:45,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:45,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-05 23:52:45,448 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 59 flow [2022-12-05 23:52:45,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) 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-05 23:52:45,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:45,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:45,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:52:45,448 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-05 23:52:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 603583251, now seen corresponding path program 1 times [2022-12-05 23:52:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:45,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111671568] [2022-12-05 23:52:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:45,605 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-05 23:52:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111671568] [2022-12-05 23:52:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111671568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:45,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:45,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:52:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957293069] [2022-12-05 23:52:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:45,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:52:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:52:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:52:45,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:52:45,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 59 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-05 23:52:45,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:45,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:52:45,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:45,682 INFO L130 PetriNetUnfolder]: 60/119 cut-off events. [2022-12-05 23:52:45,683 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 23:52:45,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 119 events. 60/119 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 311 event pairs, 11 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 249. Up to 92 conditions per place. [2022-12-05 23:52:45,684 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 23 selfloop transitions, 5 changer transitions 4/32 dead transitions. [2022-12-05 23:52:45,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 32 transitions, 168 flow [2022-12-05 23:52:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:52:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:52:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:52:45,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:52:45,688 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 59 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:52:45,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 32 transitions, 168 flow [2022-12-05 23:52:45,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 32 transitions, 144 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-05 23:52:45,691 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 79 flow [2022-12-05 23:52:45,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2022-12-05 23:52:45,693 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-05 23:52:45,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:45,693 INFO L89 Accepts]: Start accepts. Operand has 24 places, 22 transitions, 79 flow [2022-12-05 23:52:45,694 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:45,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:45,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 22 transitions, 79 flow [2022-12-05 23:52:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 79 flow [2022-12-05 23:52:45,698 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-05 23:52:45,698 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 23:52:45,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 34 events. 7/34 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 11 conditions per place. [2022-12-05 23:52:45,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 22 transitions, 79 flow [2022-12-05 23:52:45,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-05 23:52:45,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [979] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~break_6~0_145 0)) (.cse1 (= v_~name_2~0_135 v_~name_1~0_129))) (and (= (ite (not (and .cse0 (< v_~i_4~0_115 3))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= (ite .cse1 1 0) v_~break_6~0_145) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_~b#1_55|) (= v_~i_4~0_115 0) (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_56| 256) 0) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_29| |v_thread1Thread1of1ForFork0_minus_#in~b#1_30|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_32| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| |v_thread1Thread1of1ForFork0_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork0_#res#1.base_19| 0) (not .cse0) (= |v_thread1Thread1of1ForFork0_minus_#res#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_48|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_19| 0) (= (ite .cse1 0 v_~result_3~0_162) v_~result_3~0_160))) InVars {~name_2~0=v_~name_2~0_135, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_30|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_48|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_32|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_56|, ~name_1~0=v_~name_1~0_129, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_56|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_56|, ~result_3~0=v_~result_3~0_162} OutVars{~name_2~0=v_~name_2~0_135, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_19|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, ~name_1~0=v_~name_1~0_129, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_47|, ~result_3~0=v_~result_3~0_160, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ~break_6~0=v_~break_6~0_145, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_55|, thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_55|, ~i_4~0=v_~i_4~0_115, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret4#1, ~result_3~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~break_6~0, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~nondet1#1, ~i_4~0, thread1Thread1of1ForFork0_#res#1.base] and [975] L74-4-->thread2EXIT: Formula: (let ((.cse0 (= v_~break_10~0_In_18 0))) (let ((.cse1 (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_16| 0)) (.cse2 (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_16| 0)) (.cse4 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet6#1_In_5| 256) 0)) (.cse3 (ite (not (and .cse0 (< v_~i_8~0_In_13 3))) 1 0)) (.cse5 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_46| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_34|))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_10|) .cse1 .cse2 (not (= .cse3 0)) .cse4 (= (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_34|) (<= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) (= v_~name_1~0_In_33 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_10|) (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|) .cse5 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_10| v_~name_2~0_In_32) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| 2147483648)) (= v_~result_7~0_Out_50 |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26|)) (and .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_minus_#res#1_In_3| |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_10|) .cse4 (= .cse3 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_34|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_12| |v_thread2Thread1of1ForFork1_minus_~b#1_In_9|) (= v_~result_7~0_In_15 v_~result_7~0_Out_50) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork1_minus_#in~a#1_In_4|) (not .cse0) .cse5 (= |v_thread2Thread1of1ForFork1_minus_~a#1_In_10| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|))))) InVars {~name_2~0=v_~name_2~0_In_32, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_In_10|, ~break_10~0=v_~break_10~0_In_18, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_In_4|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_In_9|, ~name_1~0=v_~name_1~0_In_33, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_In_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_In_4|, thread2Thread1of1ForFork1_#t~nondet6#1=|v_thread2Thread1of1ForFork1_#t~nondet6#1_In_5|, ~result_7~0=v_~result_7~0_In_15, ~i_8~0=v_~i_8~0_In_13} OutVars{~name_2~0=v_~name_2~0_In_32, thread2Thread1of1ForFork1_#t~ite10#1=|v_thread2Thread1of1ForFork1_#t~ite10#1_Out_18|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_12|, ~name_1~0=v_~name_1~0_In_33, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_16|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_26|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_34|, ~result_7~0=v_~result_7~0_Out_50, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_46|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_12|, thread2Thread1of1ForFork1_#t~ret9#1=|v_thread2Thread1of1ForFork1_#t~ret9#1_Out_24|, ~break_10~0=v_~break_10~0_In_18, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_16|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_10|, ~i_8~0=v_~i_8~0_In_13} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ite10#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~result_7~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_#t~ret9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_#t~nondet6#1] [2022-12-05 23:52:46,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [979] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (= v_~break_6~0_145 0)) (.cse1 (= v_~name_2~0_135 v_~name_1~0_129))) (and (= (ite (not (and .cse0 (< v_~i_4~0_115 3))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= (ite .cse1 1 0) v_~break_6~0_145) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_56| |v_thread1Thread1of1ForFork0_minus_~b#1_55|) (= v_~i_4~0_115 0) (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_56| 256) 0) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_29| |v_thread1Thread1of1ForFork0_minus_#in~b#1_30|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_32| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_56| |v_thread1Thread1of1ForFork0_minus_~a#1_55|) (= |v_thread1Thread1of1ForFork0_#res#1.base_19| 0) (not .cse0) (= |v_thread1Thread1of1ForFork0_minus_#res#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_48|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_19| 0) (= (ite .cse1 0 v_~result_3~0_162) v_~result_3~0_160))) InVars {~name_2~0=v_~name_2~0_135, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_30|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_48|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_32|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_56|, ~name_1~0=v_~name_1~0_129, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_56|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_56|, ~result_3~0=v_~result_3~0_162} OutVars{~name_2~0=v_~name_2~0_135, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_19|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, ~name_1~0=v_~name_1~0_129, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_47|, ~result_3~0=v_~result_3~0_160, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ~break_6~0=v_~break_6~0_145, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_55|, thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_55|, ~i_4~0=v_~i_4~0_115, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret4#1, ~result_3~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~break_6~0, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~nondet1#1, ~i_4~0, thread1Thread1of1ForFork0_#res#1.base] and [957] L74-4-->L74-4: Formula: (let ((.cse1 (= v_~current_9~0_Out_18 v_~name_2~0_In_23))) (let ((.cse2 (ite .cse1 1 v_~break_10~0_In_14))) (let ((.cse0 (and (= v_~current_9~0_Out_18 v_~name_1~0_In_24) (= .cse2 0)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_32| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_20|) (= v_~current_9~0_Out_18 (select (select |v_#memory_int_In_17| v_~nondet_0~0.base_In_7) (+ v_~nondet_0~0.offset_In_7 (* v_~i_8~0_In_10 4)))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet6#1_In_3| 256) 0)) (= v_~result_7~0_Out_34 (ite .cse0 (- 1) (ite .cse1 1 v_~result_7~0_In_12))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_32| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_20| (ite (and (< v_~i_8~0_In_10 3) (= v_~break_10~0_In_14 0)) 1 0)) (= v_~break_10~0_Out_26 (ite .cse0 1 .cse2)) (= (+ v_~i_8~0_In_10 1) v_~i_8~0_Out_26))))) InVars {~name_2~0=v_~name_2~0_In_23, ~break_10~0=v_~break_10~0_In_14, ~name_1~0=v_~name_1~0_In_24, #memory_int=|v_#memory_int_In_17|, ~result_7~0=v_~result_7~0_In_12, thread2Thread1of1ForFork1_#t~nondet6#1=|v_thread2Thread1of1ForFork1_#t~nondet6#1_In_3|, ~nondet_0~0.base=v_~nondet_0~0.base_In_7, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_7, ~i_8~0=v_~i_8~0_In_10} OutVars{~name_2~0=v_~name_2~0_In_23, ~name_1~0=v_~name_1~0_In_24, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_20|, ~current_9~0=v_~current_9~0_Out_18, ~result_7~0=v_~result_7~0_Out_34, ~nondet_0~0.base=v_~nondet_0~0.base_In_7, ~nondet_0~0.offset=v_~nondet_0~0.offset_In_7, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_32|, ~break_10~0=v_~break_10~0_Out_26, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_Out_10|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_Out_14|, #memory_int=|v_#memory_int_In_17|, ~i_8~0=v_~i_8~0_Out_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~break_10~0, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~current_9~0, ~result_7~0, thread2Thread1of1ForFork1_#t~nondet6#1, ~i_8~0] [2022-12-05 23:52:46,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:46,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 752 [2022-12-05 23:52:46,445 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 89 flow [2022-12-05 23:52:46,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-05 23:52:46,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:46,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:46,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:52:46,445 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-05 23:52:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash -814478728, now seen corresponding path program 1 times [2022-12-05 23:52:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:46,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58040194] [2022-12-05 23:52:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:46,621 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-05 23:52:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58040194] [2022-12-05 23:52:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58040194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:46,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:46,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:52:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474596578] [2022-12-05 23:52:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:52:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:52:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:52:46,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:52:46,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 89 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:52:46,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:46,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:52:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:46,680 INFO L130 PetriNetUnfolder]: 44/92 cut-off events. [2022-12-05 23:52:46,680 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-05 23:52:46,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 92 events. 44/92 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 220 event pairs, 8 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 124. Up to 68 conditions per place. [2022-12-05 23:52:46,680 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 20 selfloop transitions, 2 changer transitions 6/28 dead transitions. [2022-12-05 23:52:46,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 152 flow [2022-12-05 23:52:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:52:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:52:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-05 23:52:46,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-05 23:52:46,681 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 89 flow. Second operand 4 states and 30 transitions. [2022-12-05 23:52:46,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 152 flow [2022-12-05 23:52:46,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 23:52:46,682 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 64 flow [2022-12-05 23:52:46,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-05 23:52:46,683 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-05 23:52:46,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:46,683 INFO L89 Accepts]: Start accepts. Operand has 28 places, 19 transitions, 64 flow [2022-12-05 23:52:46,683 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:46,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:46,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 64 flow [2022-12-05 23:52:46,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 64 flow [2022-12-05 23:52:46,686 INFO L130 PetriNetUnfolder]: 5/21 cut-off events. [2022-12-05 23:52:46,686 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:52:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 21 events. 5/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2022-12-05 23:52:46,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-05 23:52:46,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-05 23:52:46,687 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:52:46,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-05 23:52:46,687 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-05 23:52:46,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-05 23:52:46,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:46,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:46,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:52:46,688 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-05 23:52:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1790948884, now seen corresponding path program 1 times [2022-12-05 23:52:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:46,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342366693] [2022-12-05 23:52:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:46,772 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-05 23:52:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342366693] [2022-12-05 23:52:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342366693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:46,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:46,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:52:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609414965] [2022-12-05 23:52:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:52:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:52:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:52:46,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:52:46,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-05 23:52:46,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:46,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:52:46,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:46,824 INFO L130 PetriNetUnfolder]: 49/89 cut-off events. [2022-12-05 23:52:46,824 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-05 23:52:46,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 89 events. 49/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 2 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 230. Up to 60 conditions per place. [2022-12-05 23:52:46,824 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 26 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2022-12-05 23:52:46,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 154 flow [2022-12-05 23:52:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:52:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:52:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-05 23:52:46,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-05 23:52:46,825 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 30 transitions. [2022-12-05 23:52:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 154 flow [2022-12-05 23:52:46,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 30 transitions, 138 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:52:46,826 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 70 flow [2022-12-05 23:52:46,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-05 23:52:46,826 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-05 23:52:46,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:46,827 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 70 flow [2022-12-05 23:52:46,827 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:46,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:46,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 70 flow [2022-12-05 23:52:46,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 70 flow [2022-12-05 23:52:46,830 INFO L130 PetriNetUnfolder]: 5/24 cut-off events. [2022-12-05 23:52:46,830 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:52:46,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 24 events. 5/24 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2022-12-05 23:52:46,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 70 flow [2022-12-05 23:52:46,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:52:46,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:46,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 23:52:46,921 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 66 flow [2022-12-05 23:52:46,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-05 23:52:46,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:46,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:46,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:52:46,922 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-05 23:52:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash -424489402, now seen corresponding path program 2 times [2022-12-05 23:52:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:46,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560399152] [2022-12-05 23:52:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:47,068 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-05 23:52:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560399152] [2022-12-05 23:52:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560399152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:47,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:52:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309741249] [2022-12-05 23:52:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:52:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:52:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:52:47,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:52:47,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-05 23:52:47,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:47,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:52:47,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:47,140 INFO L130 PetriNetUnfolder]: 61/113 cut-off events. [2022-12-05 23:52:47,140 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-05 23:52:47,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 113 events. 61/113 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 257 event pairs, 20 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 128. Up to 82 conditions per place. [2022-12-05 23:52:47,141 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-05 23:52:47,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 175 flow [2022-12-05 23:52:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:52:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:52:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-05 23:52:47,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-05 23:52:47,142 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 66 flow. Second operand 4 states and 34 transitions. [2022-12-05 23:52:47,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 175 flow [2022-12-05 23:52:47,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 23:52:47,143 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 76 flow [2022-12-05 23:52:47,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-12-05 23:52:47,145 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-05 23:52:47,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:47,145 INFO L89 Accepts]: Start accepts. Operand has 27 places, 21 transitions, 76 flow [2022-12-05 23:52:47,145 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:47,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:47,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 21 transitions, 76 flow [2022-12-05 23:52:47,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 76 flow [2022-12-05 23:52:47,149 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-05 23:52:47,149 INFO L131 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2022-12-05 23:52:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 6/31 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 38. Up to 8 conditions per place. [2022-12-05 23:52:47,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 21 transitions, 76 flow [2022-12-05 23:52:47,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:52:47,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:47,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-05 23:52:47,236 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 81 flow [2022-12-05 23:52:47,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-05 23:52:47,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:52:47,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:52:47,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:52:47,236 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-05 23:52:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:52:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1769628957, now seen corresponding path program 1 times [2022-12-05 23:52:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:52:47,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187945941] [2022-12-05 23:52:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:52:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:52:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:52:47,938 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-05 23:52:47,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:52:47,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187945941] [2022-12-05 23:52:47,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187945941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:52:47,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:52:47,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:52:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975037284] [2022-12-05 23:52:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:52:47,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:52:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:52:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:52:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:52:47,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:52:47,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 81 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-05 23:52:47,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:52:47,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:52:47,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:52:48,179 INFO L130 PetriNetUnfolder]: 95/194 cut-off events. [2022-12-05 23:52:48,179 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-05 23:52:48,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 194 events. 95/194 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 665 event pairs, 26 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 358. Up to 111 conditions per place. [2022-12-05 23:52:48,180 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 32 selfloop transitions, 7 changer transitions 7/46 dead transitions. [2022-12-05 23:52:48,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 251 flow [2022-12-05 23:52:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:52:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:52:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 23:52:48,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2022-12-05 23:52:48,182 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 81 flow. Second operand 6 states and 44 transitions. [2022-12-05 23:52:48,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 251 flow [2022-12-05 23:52:48,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 246 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:52:48,183 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 117 flow [2022-12-05 23:52:48,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-05 23:52:48,184 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-05 23:52:48,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:52:48,184 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 117 flow [2022-12-05 23:52:48,186 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:48,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:52:48,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 117 flow [2022-12-05 23:52:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 117 flow [2022-12-05 23:52:48,196 INFO L130 PetriNetUnfolder]: 12/64 cut-off events. [2022-12-05 23:52:48,196 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-05 23:52:48,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 64 events. 12/64 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 212 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 126. Up to 15 conditions per place. [2022-12-05 23:52:48,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 117 flow [2022-12-05 23:52:48,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:52:48,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [974] L53-4-->thread1EXIT: Formula: (let ((.cse1 (= v_~break_6~0_In_18 0))) (let ((.cse0 (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_14| 0)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_In_5| 256) 0)) (.cse4 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_32| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_46|)) (.cse5 (= 0 |v_thread1Thread1of1ForFork0_#res#1.offset_Out_14|)) (.cse2 (ite (not (and .cse1 (< v_~i_4~0_In_9 3))) 1 0))) (or (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6| |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_14|) .cse0 (not .cse1) (= v_~result_3~0_Out_52 v_~result_3~0_In_17) (= .cse2 |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_32|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_In_5| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) .cse3 .cse4 .cse5 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_minus_#in~b#1_In_6|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_In_8| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_In_8| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_14|)) (and (= v_~result_3~0_Out_52 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26| 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_14|) .cse0 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_14| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_14|) .cse3 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_14| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_14|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_14|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_32|) .cse1 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_14| v_~name_2~0_In_30) .cse4 .cse5 (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|)) (not (= .cse2 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_14| v_~name_1~0_In_31))))) InVars {~name_2~0=v_~name_2~0_In_30, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_In_6|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_In_5|, ~break_6~0=v_~break_6~0_In_18, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_In_6|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_In_8|, ~name_1~0=v_~name_1~0_In_31, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_In_8|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_In_5|, ~i_4~0=v_~i_4~0_In_9, ~result_3~0=v_~result_3~0_In_17} OutVars{~name_2~0=v_~name_2~0_In_30, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_26|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_14|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_14|, ~name_1~0=v_~name_1~0_In_31, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_Out_22|, ~result_3~0=v_~result_3~0_Out_52, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_32|, ~break_6~0=v_~break_6~0_In_18, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_14|, thread1Thread1of1ForFork0_#t~ite5#1=|v_thread1Thread1of1ForFork0_#t~ite5#1_Out_24|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_46|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_14|, ~i_4~0=v_~i_4~0_In_9, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret4#1, ~result_3~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~ite5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] and [927] L107-4-->L108-3: Formula: (and (= |v_#memory_int_89| (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre24#1_23|))) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre24#1_23|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_90|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_11|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_23|, #memory_int=|v_#memory_int_89|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-05 23:52:48,530 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:52:48,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:52:48,532 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:52:48,532 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 115 flow [2022-12-05 23:52:48,532 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:52:48,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:52:48,533 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:52:48,536 INFO L158 Benchmark]: Toolchain (without parser) took 16851.19ms. Allocated memory was 202.4MB in the beginning and 375.4MB in the end (delta: 173.0MB). Free memory was 178.8MB in the beginning and 336.5MB in the end (delta: -157.7MB). Peak memory consumption was 218.2MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,536 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:52:48,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.29ms. Allocated memory is still 202.4MB. Free memory was 178.8MB in the beginning and 166.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.29ms. Allocated memory is still 202.4MB. Free memory was 166.7MB in the beginning and 164.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,536 INFO L158 Benchmark]: Boogie Preprocessor took 37.66ms. Allocated memory is still 202.4MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,537 INFO L158 Benchmark]: RCFGBuilder took 385.78ms. Allocated memory is still 202.4MB. Free memory was 162.5MB in the beginning and 142.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,537 INFO L158 Benchmark]: TraceAbstraction took 16145.74ms. Allocated memory was 202.4MB in the beginning and 375.4MB in the end (delta: 173.0MB). Free memory was 141.5MB in the beginning and 336.5MB in the end (delta: -194.9MB). Peak memory consumption was 181.5MB. Max. memory is 8.0GB. [2022-12-05 23:52:48,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.29ms. Allocated memory is still 202.4MB. Free memory was 178.8MB in the beginning and 166.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.29ms. Allocated memory is still 202.4MB. Free memory was 166.7MB in the beginning and 164.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.66ms. Allocated memory is still 202.4MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 385.78ms. Allocated memory is still 202.4MB. Free memory was 162.5MB in the beginning and 142.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16145.74ms. Allocated memory was 202.4MB in the beginning and 375.4MB in the end (delta: 173.0MB). Free memory was 141.5MB in the beginning and 336.5MB in the end (delta: -194.9MB). Peak memory consumption was 181.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 225 PlacesBefore, 21 PlacesAfterwards, 237 TransitionsBefore, 17 TransitionsAfterwards, 9548 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 113 ConcurrentYvCompositions, 16 ChoiceCompositions, 220 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5934, independent: 5931, independent conditional: 5931, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5934, independent: 5931, independent conditional: 0, independent unconditional: 5931, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5934, independent: 5931, independent conditional: 0, independent unconditional: 5931, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5934, independent: 5931, independent conditional: 0, independent unconditional: 5931, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5064, independent: 5061, independent conditional: 0, independent unconditional: 5061, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5064, independent: 5061, independent conditional: 0, independent unconditional: 5061, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5934, independent: 870, independent conditional: 0, independent unconditional: 870, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5064, unknown conditional: 0, unknown unconditional: 5064] , Statistics on independence cache: Total cache size (in pairs): 10814, Positive cache size: 10811, Positive conditional cache size: 0, Positive unconditional cache size: 10811, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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.2s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.1s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.3s, 23 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.7s, 24 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 24 PlacesBefore, 24 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 56 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): 12, Positive cache size: 12, Positive conditional cache size: 6, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 25 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 11, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 27 PlacesBefore, 27 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 17, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.3s, 33 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 5, independent: 1, independent conditional: 1, independent unconditional: 0, 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): 29, Positive cache size: 29, Positive conditional cache size: 21, Positive unconditional cache size: 8, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:52:48,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...