/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:24:36,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:24:36,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:24:36,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:24:36,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:24:36,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:24:36,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:24:36,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:24:36,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:24:36,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:24:36,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:24:36,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:24:36,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:24:36,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:24:36,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:24:36,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:24:36,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:24:36,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:24:36,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:24:36,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:24:36,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:24:36,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:24:36,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:24:36,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:24:36,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:24:36,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:24:36,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:24:36,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:24:36,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:24:36,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:24:36,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:24:36,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:24:36,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:24:36,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:24:36,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:24:36,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:24:36,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:24:36,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:24:36,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:24:36,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:24:36,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:24:36,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:24:36,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:24:36,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:24:36,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:24:36,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:24:36,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:24:36,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:24:36,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:36,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:24:36,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:24:36,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:24:36,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:24:36,517 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:24:36,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:24:36,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:24:36,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:24:36,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:24:36,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:24:36,821 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:24:36,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-symm.wvr.c [2022-12-06 07:24:37,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:24:37,995 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:24:37,995 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-symm.wvr.c [2022-12-06 07:24:38,000 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b521771d/ee1b5f8f228b44798dec6e2bf9201f52/FLAGc8f864ac3 [2022-12-06 07:24:38,012 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b521771d/ee1b5f8f228b44798dec6e2bf9201f52 [2022-12-06 07:24:38,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:24:38,015 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:24:38,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:38,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:24:38,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:24:38,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13af60cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38, skipping insertion in model container [2022-12-06 07:24:38,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:24:38,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:24:38,202 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-word-symm.wvr.c[2848,2861] [2022-12-06 07:24:38,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:38,223 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:24:38,243 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-word-symm.wvr.c[2848,2861] [2022-12-06 07:24:38,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:38,259 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:24:38,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38 WrapperNode [2022-12-06 07:24:38,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:38,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:38,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:24:38,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:24:38,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,308 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 128 [2022-12-06 07:24:38,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:38,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:24:38,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:24:38,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:24:38,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:24:38,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:24:38,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:24:38,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:24:38,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (1/1) ... [2022-12-06 07:24:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:38,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:24:38,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:24:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:24:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:24:38,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:24:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:24:38,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:24:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:24:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:24:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:24:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:24:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:24:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:24:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:24:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:24:38,436 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:24:38,531 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:24:38,533 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:24:38,886 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:24:38,893 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:24:38,893 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:24:38,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:38 BoogieIcfgContainer [2022-12-06 07:24:38,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:24:38,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:24:38,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:24:38,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:24:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:24:38" (1/3) ... [2022-12-06 07:24:38,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d15b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:38, skipping insertion in model container [2022-12-06 07:24:38,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:38" (2/3) ... [2022-12-06 07:24:38,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d15b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:38, skipping insertion in model container [2022-12-06 07:24:38,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:38" (3/3) ... [2022-12-06 07:24:38,901 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2022-12-06 07:24:38,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:24:38,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:24:38,914 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:24:38,991 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:24:39,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 207 transitions, 430 flow [2022-12-06 07:24:39,101 INFO L130 PetriNetUnfolder]: 21/205 cut-off events. [2022-12-06 07:24:39,102 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 21/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 224 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 07:24:39,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 207 transitions, 430 flow [2022-12-06 07:24:39,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 197 transitions, 406 flow [2022-12-06 07:24:39,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:39,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 197 transitions, 406 flow [2022-12-06 07:24:39,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 197 transitions, 406 flow [2022-12-06 07:24:39,184 INFO L130 PetriNetUnfolder]: 21/197 cut-off events. [2022-12-06 07:24:39,184 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:39,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 197 events. 21/197 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-06 07:24:39,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 197 transitions, 406 flow [2022-12-06 07:24:39,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 2700 [2022-12-06 07:24:45,263 INFO L203 LiptonReduction]: Total number of compositions: 172 [2022-12-06 07:24:45,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:24:45,280 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;@59d0fe92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:24:45,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:24:45,284 INFO L130 PetriNetUnfolder]: 7/24 cut-off events. [2022-12-06 07:24:45,284 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:45,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:45,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:45,286 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1678144266, now seen corresponding path program 1 times [2022-12-06 07:24:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737119185] [2022-12-06 07:24:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737119185] [2022-12-06 07:24:45,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737119185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:45,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:45,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058832543] [2022-12-06 07:24:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:45,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:24:45,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:45,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:45,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:24:45,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:45,849 INFO L130 PetriNetUnfolder]: 98/170 cut-off events. [2022-12-06 07:24:45,849 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:24:45,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 170 events. 98/170 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 42 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 290. Up to 132 conditions per place. [2022-12-06 07:24:45,853 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 33 selfloop transitions, 1 changer transitions 5/40 dead transitions. [2022-12-06 07:24:45,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 182 flow [2022-12-06 07:24:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:24:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:24:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 07:24:45,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 07:24:45,864 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 62 flow. Second operand 4 states and 45 transitions. [2022-12-06 07:24:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 182 flow [2022-12-06 07:24:45,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:24:45,868 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 63 flow [2022-12-06 07:24:45,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-06 07:24:45,873 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2022-12-06 07:24:45,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:45,874 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 63 flow [2022-12-06 07:24:45,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:45,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:45,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 63 flow [2022-12-06 07:24:45,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 63 flow [2022-12-06 07:24:45,890 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 07:24:45,890 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:45,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 6/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2022-12-06 07:24:45,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 63 flow [2022-12-06 07:24:45,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 07:24:45,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:45,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:24:45,905 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 63 flow [2022-12-06 07:24:45,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:45,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:45,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:45,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:24:45,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -418621268, now seen corresponding path program 2 times [2022-12-06 07:24:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:45,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453928223] [2022-12-06 07:24:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453928223] [2022-12-06 07:24:46,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453928223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:46,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:46,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157187191] [2022-12-06 07:24:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:46,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:46,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:24:46,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:46,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:46,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:24:46,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:46,254 INFO L130 PetriNetUnfolder]: 105/193 cut-off events. [2022-12-06 07:24:46,254 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-06 07:24:46,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 193 events. 105/193 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 627 event pairs, 55 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 417. Up to 155 conditions per place. [2022-12-06 07:24:46,268 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 30 selfloop transitions, 1 changer transitions 7/39 dead transitions. [2022-12-06 07:24:46,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 177 flow [2022-12-06 07:24:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:24:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:24:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 07:24:46,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 07:24:46,270 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 63 flow. Second operand 4 states and 44 transitions. [2022-12-06 07:24:46,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 177 flow [2022-12-06 07:24:46,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 171 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:46,273 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 69 flow [2022-12-06 07:24:46,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 07:24:46,274 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-06 07:24:46,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:46,274 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 69 flow [2022-12-06 07:24:46,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:46,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:46,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 69 flow [2022-12-06 07:24:46,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 69 flow [2022-12-06 07:24:46,280 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-12-06 07:24:46,280 INFO L131 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2022-12-06 07:24:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 35 events. 5/35 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-06 07:24:46,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 69 flow [2022-12-06 07:24:46,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 07:24:46,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:46,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 07:24:46,283 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 69 flow [2022-12-06 07:24:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:46,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:46,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:46,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:24:46,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1770513969, now seen corresponding path program 1 times [2022-12-06 07:24:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:46,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365010835] [2022-12-06 07:24:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:46,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365010835] [2022-12-06 07:24:46,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365010835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:46,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:46,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337474998] [2022-12-06 07:24:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:46,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:24:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:46,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:24:46,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:24:46,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:24:46,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:46,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:46,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:24:46,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:46,360 INFO L130 PetriNetUnfolder]: 76/139 cut-off events. [2022-12-06 07:24:46,360 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-06 07:24:46,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 139 events. 76/139 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 389 event pairs, 20 based on Foata normal form. 14/131 useless extension candidates. Maximal degree in co-relation 311. Up to 114 conditions per place. [2022-12-06 07:24:46,361 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 25 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 07:24:46,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 151 flow [2022-12-06 07:24:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:24:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:24:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 07:24:46,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 07:24:46,362 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 69 flow. Second operand 3 states and 36 transitions. [2022-12-06 07:24:46,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 151 flow [2022-12-06 07:24:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:46,363 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 72 flow [2022-12-06 07:24:46,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 07:24:46,363 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-06 07:24:46,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:46,364 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 72 flow [2022-12-06 07:24:46,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:46,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:46,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 72 flow [2022-12-06 07:24:46,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 72 flow [2022-12-06 07:24:46,367 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-06 07:24:46,367 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:24:46,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 27 events. 7/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 4 conditions per place. [2022-12-06 07:24:46,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 72 flow [2022-12-06 07:24:46,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 07:24:46,368 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:46,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:24:46,369 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 72 flow [2022-12-06 07:24:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:46,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:46,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:46,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:24:46,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -918566503, now seen corresponding path program 1 times [2022-12-06 07:24:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:46,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506931688] [2022-12-06 07:24:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506931688] [2022-12-06 07:24:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506931688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:46,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:24:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442129119] [2022-12-06 07:24:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:46,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:24:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:24:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:24:46,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:24:46,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 72 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:46,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:46,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:24:46,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:47,009 INFO L130 PetriNetUnfolder]: 140/263 cut-off events. [2022-12-06 07:24:47,009 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 07:24:47,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 263 events. 140/263 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 920 event pairs, 19 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 239. Up to 63 conditions per place. [2022-12-06 07:24:47,014 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 59 selfloop transitions, 14 changer transitions 7/81 dead transitions. [2022-12-06 07:24:47,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 384 flow [2022-12-06 07:24:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:24:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:24:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-12-06 07:24:47,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39565217391304347 [2022-12-06 07:24:47,018 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 72 flow. Second operand 10 states and 91 transitions. [2022-12-06 07:24:47,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 384 flow [2022-12-06 07:24:47,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 81 transitions, 362 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:47,022 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 178 flow [2022-12-06 07:24:47,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=178, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-12-06 07:24:47,023 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2022-12-06 07:24:47,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:47,023 INFO L89 Accepts]: Start accepts. Operand has 40 places, 38 transitions, 178 flow [2022-12-06 07:24:47,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:47,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:47,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 38 transitions, 178 flow [2022-12-06 07:24:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 178 flow [2022-12-06 07:24:47,030 INFO L130 PetriNetUnfolder]: 15/66 cut-off events. [2022-12-06 07:24:47,030 INFO L131 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2022-12-06 07:24:47,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 66 events. 15/66 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 1 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 114. Up to 12 conditions per place. [2022-12-06 07:24:47,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 178 flow [2022-12-06 07:24:47,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 07:24:47,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:51,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [783] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~stop~0_41 1) (= v_thread1Thread1of1ForFork1_~i~0_95 0) (= v_~count1~0_53 v_~count2~0_61) (= |v_thread1Thread1of1ForFork1_#res.base_31| 0) (= v_~res1~0_82 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_54| (select (select |v_#memory_int_219| v_~get2~0.base_95) (+ v_~get2~0.offset_95 (* v_thread1Thread1of1ForFork1_~i~0_95 4)))) (- 1) 1)) (= |v_thread1Thread1of1ForFork1_#res.offset_31| 0)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_54|, ~count2~0=v_~count2~0_61, ~get2~0.offset=v_~get2~0.offset_95, ~count1~0=v_~count1~0_53, #memory_int=|v_#memory_int_219|, ~get2~0.base=v_~get2~0.base_95} OutVars{~res1~0=v_~res1~0_82, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_31|, ~count2~0=v_~count2~0_61, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_35|, ~get2~0.offset=v_~get2~0.offset_95, ~count1~0=v_~count1~0_53, #memory_int=|v_#memory_int_219|, ~get2~0.base=v_~get2~0.base_95, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_95, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_31|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_41} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:51,751 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:24:51,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4729 [2022-12-06 07:24:51,752 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 173 flow [2022-12-06 07:24:51,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:51,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:51,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:24:51,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2050688727, now seen corresponding path program 1 times [2022-12-06 07:24:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:51,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315499712] [2022-12-06 07:24:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:52,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315499712] [2022-12-06 07:24:52,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315499712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:52,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:52,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:24:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453240045] [2022-12-06 07:24:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:52,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:24:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:24:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:24:52,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 07:24:52,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 173 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:52,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:52,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 07:24:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:52,352 INFO L130 PetriNetUnfolder]: 236/463 cut-off events. [2022-12-06 07:24:52,353 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-06 07:24:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 463 events. 236/463 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2047 event pairs, 88 based on Foata normal form. 15/474 useless extension candidates. Maximal degree in co-relation 1060. Up to 244 conditions per place. [2022-12-06 07:24:52,355 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 74 selfloop transitions, 12 changer transitions 6/93 dead transitions. [2022-12-06 07:24:52,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 93 transitions, 551 flow [2022-12-06 07:24:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:24:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:24:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-12-06 07:24:52,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2022-12-06 07:24:52,357 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 173 flow. Second operand 9 states and 86 transitions. [2022-12-06 07:24:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 93 transitions, 551 flow [2022-12-06 07:24:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 93 transitions, 527 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:52,359 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 252 flow [2022-12-06 07:24:52,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 07:24:52,360 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 24 predicate places. [2022-12-06 07:24:52,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:52,360 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 252 flow [2022-12-06 07:24:52,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:52,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:52,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 252 flow [2022-12-06 07:24:52,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 252 flow [2022-12-06 07:24:52,370 INFO L130 PetriNetUnfolder]: 27/124 cut-off events. [2022-12-06 07:24:52,370 INFO L131 PetriNetUnfolder]: For 135/141 co-relation queries the response was YES. [2022-12-06 07:24:52,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 124 events. 27/124 cut-off events. For 135/141 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 1 based on Foata normal form. 3/120 useless extension candidates. Maximal degree in co-relation 285. Up to 24 conditions per place. [2022-12-06 07:24:52,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 252 flow [2022-12-06 07:24:52,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 07:24:52,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:52,982 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:52,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-06 07:24:52,984 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 257 flow [2022-12-06 07:24:52,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:52,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:52,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:52,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:24:52,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -233105318, now seen corresponding path program 1 times [2022-12-06 07:24:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:52,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757233308] [2022-12-06 07:24:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757233308] [2022-12-06 07:24:53,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757233308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:53,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:53,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004115411] [2022-12-06 07:24:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:53,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:53,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 07:24:53,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 257 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:53,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 07:24:53,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:53,469 INFO L130 PetriNetUnfolder]: 332/648 cut-off events. [2022-12-06 07:24:53,469 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-06 07:24:53,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 648 events. 332/648 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3176 event pairs, 144 based on Foata normal form. 11/656 useless extension candidates. Maximal degree in co-relation 2148. Up to 436 conditions per place. [2022-12-06 07:24:53,473 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 86 selfloop transitions, 10 changer transitions 5/102 dead transitions. [2022-12-06 07:24:53,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 708 flow [2022-12-06 07:24:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:24:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:24:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 07:24:53,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 07:24:53,474 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 257 flow. Second operand 7 states and 87 transitions. [2022-12-06 07:24:53,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 708 flow [2022-12-06 07:24:53,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 663 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-06 07:24:53,479 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 351 flow [2022-12-06 07:24:53,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 07:24:53,479 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 30 predicate places. [2022-12-06 07:24:53,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:53,480 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 351 flow [2022-12-06 07:24:53,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:53,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:53,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 351 flow [2022-12-06 07:24:53,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 351 flow [2022-12-06 07:24:53,493 INFO L130 PetriNetUnfolder]: 38/175 cut-off events. [2022-12-06 07:24:53,494 INFO L131 PetriNetUnfolder]: For 264/273 co-relation queries the response was YES. [2022-12-06 07:24:53,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 175 events. 38/175 cut-off events. For 264/273 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 938 event pairs, 1 based on Foata normal form. 4/168 useless extension candidates. Maximal degree in co-relation 445. Up to 35 conditions per place. [2022-12-06 07:24:53,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 351 flow [2022-12-06 07:24:53,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 07:24:53,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:53,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:54,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:54,440 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:54,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 07:24:54,441 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 369 flow [2022-12-06 07:24:54,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:54,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:54,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:54,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:24:54,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 689583158, now seen corresponding path program 1 times [2022-12-06 07:24:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990927663] [2022-12-06 07:24:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:54,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990927663] [2022-12-06 07:24:54,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990927663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:54,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:54,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327215789] [2022-12-06 07:24:54,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:54,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:54,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:24:54,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 369 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:54,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:54,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:24:54,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:54,976 INFO L130 PetriNetUnfolder]: 294/601 cut-off events. [2022-12-06 07:24:54,976 INFO L131 PetriNetUnfolder]: For 1425/1425 co-relation queries the response was YES. [2022-12-06 07:24:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 601 events. 294/601 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3014 event pairs, 129 based on Foata normal form. 17/614 useless extension candidates. Maximal degree in co-relation 2071. Up to 383 conditions per place. [2022-12-06 07:24:54,980 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 79 selfloop transitions, 13 changer transitions 5/98 dead transitions. [2022-12-06 07:24:54,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 726 flow [2022-12-06 07:24:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:24:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:24:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 07:24:54,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2022-12-06 07:24:54,981 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 369 flow. Second operand 8 states and 89 transitions. [2022-12-06 07:24:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 726 flow [2022-12-06 07:24:54,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 665 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-06 07:24:54,985 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 410 flow [2022-12-06 07:24:54,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-06 07:24:54,986 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 35 predicate places. [2022-12-06 07:24:54,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:54,986 INFO L89 Accepts]: Start accepts. Operand has 60 places, 55 transitions, 410 flow [2022-12-06 07:24:54,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:54,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:54,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 410 flow [2022-12-06 07:24:54,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 410 flow [2022-12-06 07:24:55,000 INFO L130 PetriNetUnfolder]: 35/177 cut-off events. [2022-12-06 07:24:55,000 INFO L131 PetriNetUnfolder]: For 352/363 co-relation queries the response was YES. [2022-12-06 07:24:55,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 177 events. 35/177 cut-off events. For 352/363 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 978 event pairs, 1 based on Foata normal form. 6/171 useless extension candidates. Maximal degree in co-relation 446. Up to 35 conditions per place. [2022-12-06 07:24:55,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 410 flow [2022-12-06 07:24:55,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 07:24:55,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread2Thread1of1ForFork0_~stop~1_33 0) (= v_thread2Thread1of1ForFork0_~i~1_65 0) (= |v_thread1Thread1of1ForFork1_#res.base_35| 0) (= v_~count1~0_65 v_~count2~0_73) (= v_~res1~0_94 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_62| (select (select |v_#memory_int_237| v_~get2~0.base_109) (+ v_~get2~0.offset_109 (* v_thread1Thread1of1ForFork1_~i~0_99 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_47 1) (= |v_thread1Thread1of1ForFork1_#res.offset_35| 0)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_62|, ~count2~0=v_~count2~0_73, ~get2~0.offset=v_~get2~0.offset_109, ~count1~0=v_~count1~0_65, #memory_int=|v_#memory_int_237|, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99} OutVars{~res1~0=v_~res1~0_94, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_35|, ~count2~0=v_~count2~0_73, ~count1~0=v_~count1~0_65, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_35|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_65, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_33, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_39|, ~get2~0.offset=v_~get2~0.offset_109, #memory_int=|v_#memory_int_237|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_47} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [799] L51-1-->L49-6: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_49| 0) (= v_thread1Thread1of1ForFork1_~stop~0_65 0) (= v_thread1Thread1of1ForFork1_~i~0_117 0) (= v_~count1~0_77 v_~count2~0_85) (= |v_thread1Thread1of1ForFork1_#res.base_49| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_90| (select (select |v_#memory_int_259| v_~get2~0.base_125) (+ v_~get2~0.offset_125 (* v_thread1Thread1of1ForFork1_~i~0_118 4)))) (- 1) 1) v_~res1~0_108)) InVars {~count2~0=v_~count2~0_85, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_90|, ~count1~0=v_~count1~0_77, ~get2~0.offset=v_~get2~0.offset_125, #memory_int=|v_#memory_int_259|, ~get2~0.base=v_~get2~0.base_125, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_118} OutVars{~res1~0=v_~res1~0_108, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_49|, ~count2~0=v_~count2~0_85, ~count1~0=v_~count1~0_77, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_53|, ~get2~0.offset=v_~get2~0.offset_125, #memory_int=|v_#memory_int_259|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_117, ~get2~0.base=v_~get2~0.base_125, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_49|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_65} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [799] L51-1-->L49-6: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_49| 0) (= v_thread1Thread1of1ForFork1_~stop~0_65 0) (= v_thread1Thread1of1ForFork1_~i~0_117 0) (= v_~count1~0_77 v_~count2~0_85) (= |v_thread1Thread1of1ForFork1_#res.base_49| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_90| (select (select |v_#memory_int_259| v_~get2~0.base_125) (+ v_~get2~0.offset_125 (* v_thread1Thread1of1ForFork1_~i~0_118 4)))) (- 1) 1) v_~res1~0_108)) InVars {~count2~0=v_~count2~0_85, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_90|, ~count1~0=v_~count1~0_77, ~get2~0.offset=v_~get2~0.offset_125, #memory_int=|v_#memory_int_259|, ~get2~0.base=v_~get2~0.base_125, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_118} OutVars{~res1~0=v_~res1~0_108, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_49|, ~count2~0=v_~count2~0_85, ~count1~0=v_~count1~0_77, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_53|, ~get2~0.offset=v_~get2~0.offset_125, #memory_int=|v_#memory_int_259|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_117, ~get2~0.base=v_~get2~0.base_125, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_49|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_65} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:55,632 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:55,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 647 [2022-12-06 07:24:55,633 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 487 flow [2022-12-06 07:24:55,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:55,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:55,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:55,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:24:55,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1337136656, now seen corresponding path program 2 times [2022-12-06 07:24:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58978762] [2022-12-06 07:24:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:55,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58978762] [2022-12-06 07:24:55,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58978762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:55,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294195396] [2022-12-06 07:24:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:55,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 07:24:55,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:55,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:55,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 07:24:55,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:56,070 INFO L130 PetriNetUnfolder]: 274/568 cut-off events. [2022-12-06 07:24:56,070 INFO L131 PetriNetUnfolder]: For 1342/1342 co-relation queries the response was YES. [2022-12-06 07:24:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 568 events. 274/568 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2844 event pairs, 131 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 1993. Up to 383 conditions per place. [2022-12-06 07:24:56,074 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 62 selfloop transitions, 10 changer transitions 12/85 dead transitions. [2022-12-06 07:24:56,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 644 flow [2022-12-06 07:24:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:24:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:24:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-06 07:24:56,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2604166666666667 [2022-12-06 07:24:56,075 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 487 flow. Second operand 8 states and 75 transitions. [2022-12-06 07:24:56,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 644 flow [2022-12-06 07:24:56,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 627 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:24:56,079 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 381 flow [2022-12-06 07:24:56,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=381, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2022-12-06 07:24:56,079 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2022-12-06 07:24:56,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:56,079 INFO L89 Accepts]: Start accepts. Operand has 68 places, 51 transitions, 381 flow [2022-12-06 07:24:56,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:56,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:56,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 51 transitions, 381 flow [2022-12-06 07:24:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 51 transitions, 381 flow [2022-12-06 07:24:56,092 INFO L130 PetriNetUnfolder]: 31/165 cut-off events. [2022-12-06 07:24:56,092 INFO L131 PetriNetUnfolder]: For 340/348 co-relation queries the response was YES. [2022-12-06 07:24:56,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 165 events. 31/165 cut-off events. For 340/348 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 891 event pairs, 1 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 438. Up to 31 conditions per place. [2022-12-06 07:24:56,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 51 transitions, 381 flow [2022-12-06 07:24:56,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 07:24:56,094 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:56,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:24:56,095 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 381 flow [2022-12-06 07:24:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:56,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:56,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:56,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:24:56,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -670783656, now seen corresponding path program 3 times [2022-12-06 07:24:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:56,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100262841] [2022-12-06 07:24:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:56,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100262841] [2022-12-06 07:24:56,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100262841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:56,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:56,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865552540] [2022-12-06 07:24:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:56,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:56,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:24:56,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 381 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:56,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:56,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:24:56,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:56,540 INFO L130 PetriNetUnfolder]: 265/543 cut-off events. [2022-12-06 07:24:56,540 INFO L131 PetriNetUnfolder]: For 1517/1517 co-relation queries the response was YES. [2022-12-06 07:24:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 543 events. 265/543 cut-off events. For 1517/1517 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2653 event pairs, 120 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1979. Up to 383 conditions per place. [2022-12-06 07:24:56,544 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 69 selfloop transitions, 9 changer transitions 5/84 dead transitions. [2022-12-06 07:24:56,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 646 flow [2022-12-06 07:24:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:24:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:24:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-06 07:24:56,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3275862068965517 [2022-12-06 07:24:56,545 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 381 flow. Second operand 8 states and 76 transitions. [2022-12-06 07:24:56,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 646 flow [2022-12-06 07:24:56,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 625 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 07:24:56,549 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 386 flow [2022-12-06 07:24:56,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2022-12-06 07:24:56,550 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 44 predicate places. [2022-12-06 07:24:56,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:56,550 INFO L89 Accepts]: Start accepts. Operand has 69 places, 51 transitions, 386 flow [2022-12-06 07:24:56,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:56,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:56,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 51 transitions, 386 flow [2022-12-06 07:24:56,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 51 transitions, 386 flow [2022-12-06 07:24:56,566 INFO L130 PetriNetUnfolder]: 31/160 cut-off events. [2022-12-06 07:24:56,566 INFO L131 PetriNetUnfolder]: For 346/353 co-relation queries the response was YES. [2022-12-06 07:24:56,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 160 events. 31/160 cut-off events. For 346/353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 837 event pairs, 1 based on Foata normal form. 3/151 useless extension candidates. Maximal degree in co-relation 416. Up to 30 conditions per place. [2022-12-06 07:24:56,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 51 transitions, 386 flow [2022-12-06 07:24:56,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:24:56,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:57,059 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:57,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-06 07:24:57,060 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 376 flow [2022-12-06 07:24:57,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:57,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:57,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:57,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:24:57,060 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1838364766, now seen corresponding path program 2 times [2022-12-06 07:24:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:57,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698758285] [2022-12-06 07:24:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:57,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:57,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698758285] [2022-12-06 07:24:57,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698758285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:57,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256306240] [2022-12-06 07:24:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:57,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:57,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:57,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:57,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:24:57,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:57,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:57,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:24:57,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:57,479 INFO L130 PetriNetUnfolder]: 235/513 cut-off events. [2022-12-06 07:24:57,479 INFO L131 PetriNetUnfolder]: For 1563/1563 co-relation queries the response was YES. [2022-12-06 07:24:57,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 513 events. 235/513 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2601 event pairs, 121 based on Foata normal form. 17/525 useless extension candidates. Maximal degree in co-relation 1803. Up to 349 conditions per place. [2022-12-06 07:24:57,482 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 79 selfloop transitions, 11 changer transitions 6/97 dead transitions. [2022-12-06 07:24:57,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 765 flow [2022-12-06 07:24:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:24:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:24:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:24:57,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-06 07:24:57,483 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 376 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:24:57,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 765 flow [2022-12-06 07:24:57,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 715 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-12-06 07:24:57,487 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 448 flow [2022-12-06 07:24:57,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2022-12-06 07:24:57,489 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 42 predicate places. [2022-12-06 07:24:57,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:57,489 INFO L89 Accepts]: Start accepts. Operand has 67 places, 55 transitions, 448 flow [2022-12-06 07:24:57,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:57,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:57,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 55 transitions, 448 flow [2022-12-06 07:24:57,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 448 flow [2022-12-06 07:24:57,502 INFO L130 PetriNetUnfolder]: 28/165 cut-off events. [2022-12-06 07:24:57,502 INFO L131 PetriNetUnfolder]: For 408/418 co-relation queries the response was YES. [2022-12-06 07:24:57,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 165 events. 28/165 cut-off events. For 408/418 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 914 event pairs, 1 based on Foata normal form. 5/155 useless extension candidates. Maximal degree in co-relation 433. Up to 31 conditions per place. [2022-12-06 07:24:57,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 448 flow [2022-12-06 07:24:57,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 07:24:57,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:57,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:57,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_45| 0) (= v_thread1Thread1of1ForFork1_~stop~0_57 1) (= v_thread2Thread1of1ForFork0_~i~1_75 0) (= v_~count1~0_71 v_~count2~0_79) (= v_thread2Thread1of1ForFork0_~stop~1_51 0) (= |v_thread1Thread1of1ForFork1_#res.base_45| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_82| (select (select |v_#memory_int_255| v_~get2~0.base_121) (+ v_~get2~0.offset_121 (* v_thread1Thread1of1ForFork1_~i~0_109 4)))) (- 1) 1) v_~res1~0_104)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_82|, ~count2~0=v_~count2~0_79, ~get2~0.offset=v_~get2~0.offset_121, ~count1~0=v_~count1~0_71, #memory_int=|v_#memory_int_255|, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109} OutVars{~res1~0=v_~res1~0_104, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_45|, ~count2~0=v_~count2~0_79, ~count1~0=v_~count1~0_71, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_45|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_75, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_51, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_49|, ~get2~0.offset=v_~get2~0.offset_121, #memory_int=|v_#memory_int_255|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_57} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:57,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (select |v_#memory_int_253| v_~get2~0.base_119))) (and (let ((.cse0 (< v_thread2Thread1of1ForFork0_~i~1_73 v_~n2~0_112)) (.cse3 (< v_thread2Thread1of1ForFork0_~i~1_73 v_~n1~0_100))) (or (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_73 4))) (let ((.cse2 (select .cse5 (+ v_~get2~0.offset_119 .cse4))) (.cse1 (select (select |v_#memory_int_253| v_~get1~0.base_107) (+ v_~get1~0.offset_107 .cse4)))) (and .cse0 (not (= .cse1 .cse2)) (= v_thread2Thread1of1ForFork0_~stop~1_47 1) (= (ite (< .cse2 .cse1) (- 1) 1) v_~res2~0_105) .cse3))) (and (or (not .cse0) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem7_64| |v_thread2Thread1of1ForFork0_#t~mem7_63|) (= v_~res2~0_104 v_~res2~0_105) (= |v_thread2Thread1of1ForFork0_#t~mem9_49| |v_thread2Thread1of1ForFork0_#t~mem9_50|) (= |v_thread2Thread1of1ForFork0_#t~mem8_58| |v_thread2Thread1of1ForFork0_#t~mem8_57|) (= |v_thread2Thread1of1ForFork0_#t~mem10_38| |v_thread2Thread1of1ForFork0_#t~mem10_37|) (= v_thread2Thread1of1ForFork0_~stop~1_47 0)))) (= |v_thread1Thread1of1ForFork1_#res.base_43| 0) (let ((.cse6 (= |v_thread2Thread1of1ForFork0_#res.base_25| 0)) (.cse7 (= |v_thread2Thread1of1ForFork0_#res.offset_25| 0)) (.cse8 (= (mod v_thread2Thread1of1ForFork0_~stop~1_47 256) 0))) (or (and .cse6 .cse7 (= (+ v_~n1~0_100 v_~res2~0_103) v_~n2~0_112) .cse8) (and .cse6 .cse7 (not .cse8) (= v_~res2~0_103 v_~res2~0_105)))) (= v_thread2Thread1of1ForFork0_~i~1_73 0) (= v_~res1~0_102 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_78| (select .cse5 (+ v_~get2~0.offset_119 (* v_thread1Thread1of1ForFork1_~i~0_107 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_55 1) (= v_~count1~0_69 v_~count2~0_77) (= |v_thread1Thread1of1ForFork1_#res.offset_43| 0))) InVars {~n2~0=v_~n2~0_112, ~n1~0=v_~n1~0_100, ~count2~0=v_~count2~0_77, ~count1~0=v_~count1~0_69, ~get2~0.base=v_~get2~0.base_119, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~get1~0.base=v_~get1~0.base_107, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_58|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_50|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_64|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_78|, ~get2~0.offset=v_~get2~0.offset_119, #memory_int=|v_#memory_int_253|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_38|, ~get1~0.offset=v_~get1~0.offset_107, ~res2~0=v_~res2~0_104} OutVars{~res1~0=v_~res1~0_102, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_25|, ~n1~0=v_~n1~0_100, ~count2~0=v_~count2~0_77, ~get2~0.base=v_~get2~0.base_119, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~get1~0.base=v_~get1~0.base_107, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_25|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_47|, ~get2~0.offset=v_~get2~0.offset_119, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_55, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_37|, ~res2~0=v_~res2~0_103, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_43|, ~n2~0=v_~n2~0_112, ~count1~0=v_~count1~0_69, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_43|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_73, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_57|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_49|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_63|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_47, #memory_int=|v_#memory_int_253|, ~get1~0.offset=v_~get1~0.offset_107} AuxVars[v_~res2~0_105] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] L69-6-->thread1EXIT: Formula: (let ((.cse5 (select |v_#memory_int_273| v_~get2~0.base_139))) (and (let ((.cse2 (< v_thread2Thread1of1ForFork0_~i~1_91 v_~n2~0_122)) (.cse3 (< v_thread2Thread1of1ForFork0_~i~1_91 v_~n1~0_110))) (or (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_91 4))) (let ((.cse0 (select .cse5 (+ v_~get2~0.offset_139 .cse4))) (.cse1 (select (select |v_#memory_int_273| v_~get1~0.base_117) (+ v_~get1~0.offset_117 .cse4)))) (and (not (= .cse0 .cse1)) .cse2 (= (ite (< .cse0 .cse1) (- 1) 1) v_~res2~0_140) (= v_thread2Thread1of1ForFork0_~stop~1_75 1) .cse3))) (and (= |v_thread2Thread1of1ForFork0_#t~mem7_84| |v_thread2Thread1of1ForFork0_#t~mem7_83|) (or (not .cse2) (not .cse3)) (= v_~res2~0_139 v_~res2~0_140) (= |v_thread2Thread1of1ForFork0_#t~mem9_69| |v_thread2Thread1of1ForFork0_#t~mem9_70|) (= |v_thread2Thread1of1ForFork0_#t~mem10_58| |v_thread2Thread1of1ForFork0_#t~mem10_57|) (= v_thread2Thread1of1ForFork0_~stop~1_76 v_thread2Thread1of1ForFork0_~stop~1_75) (= |v_thread2Thread1of1ForFork0_#t~mem8_78| |v_thread2Thread1of1ForFork0_#t~mem8_77|)))) (= v_thread1Thread1of1ForFork1_~stop~0_87 1) (= |v_thread1Thread1of1ForFork1_#res.base_63| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_63| 0) (let ((.cse7 (= |v_thread2Thread1of1ForFork0_#res.base_35| 0)) (.cse6 (= (mod v_thread2Thread1of1ForFork0_~stop~1_75 256) 0)) (.cse8 (= |v_thread2Thread1of1ForFork0_#res.offset_35| 0))) (or (and .cse6 .cse7 (= (+ v_~n1~0_110 v_~res2~0_138) v_~n2~0_122) .cse8) (and (= v_~res2~0_138 v_~res2~0_140) .cse7 (not .cse6) .cse8))) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_118| (select .cse5 (+ v_~get2~0.offset_139 (* v_thread1Thread1of1ForFork1_~i~0_143 4)))) (- 1) 1) v_~res1~0_122))) InVars {~n2~0=v_~n2~0_122, ~n1~0=v_~n1~0_110, ~get2~0.base=v_~get2~0.base_139, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_143, ~get1~0.base=v_~get1~0.base_117, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_91, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_78|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_70|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_84|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_118|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_76, ~get2~0.offset=v_~get2~0.offset_139, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_58|, ~get1~0.offset=v_~get1~0.offset_117, ~res2~0=v_~res2~0_139} OutVars{~res1~0=v_~res1~0_122, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_35|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_63|, ~n2~0=v_~n2~0_122, ~n1~0=v_~n1~0_110, ~get2~0.base=v_~get2~0.base_139, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_143, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_63|, ~get1~0.base=v_~get1~0.base_117, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_91, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_77|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_69|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_83|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_35|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_75, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_67|, ~get2~0.offset=v_~get2~0.offset_139, #memory_int=|v_#memory_int_273|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_87, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_57|, ~get1~0.offset=v_~get1~0.offset_117, ~res2~0=v_~res2~0_138} AuxVars[v_~res2~0_140] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [808] L69-6-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_275| v_~get2~0.base_141))) (and (= |v_thread1Thread1of1ForFork1_#res.base_65| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_122| (select .cse0 (+ v_~get2~0.offset_141 (* v_thread1Thread1of1ForFork1_~i~0_145 4)))) (- 1) 1) v_~res1~0_124) (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.base_37| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.offset_37| 0)) (.cse3 (= (mod v_thread2Thread1of1ForFork0_~stop~1_79 256) 0))) (or (and .cse1 .cse2 (= v_~res2~0_146 v_~res2~0_144) (not .cse3)) (and .cse1 .cse2 .cse3 (= v_~n2~0_124 (+ v_~n1~0_112 v_~res2~0_144))))) (= v_thread1Thread1of1ForFork1_~stop~0_89 1) (let ((.cse5 (< v_thread2Thread1of1ForFork0_~i~1_93 v_~n2~0_124)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_93 v_~n1~0_112))) (or (and (= v_thread2Thread1of1ForFork0_~stop~1_80 v_thread2Thread1of1ForFork0_~stop~1_79) (= v_~res2~0_146 v_~res2~0_145) (= |v_thread2Thread1of1ForFork0_#t~mem8_82| |v_thread2Thread1of1ForFork0_#t~mem8_81|) (= |v_thread2Thread1of1ForFork0_#t~mem10_62| |v_thread2Thread1of1ForFork0_#t~mem10_61|) (= |v_thread2Thread1of1ForFork0_#t~mem7_88| |v_thread2Thread1of1ForFork0_#t~mem7_87|) (= |v_thread2Thread1of1ForFork0_#t~mem9_74| |v_thread2Thread1of1ForFork0_#t~mem9_73|) (or (not .cse4) (not .cse5))) (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_93 4))) (let ((.cse7 (select (select |v_#memory_int_275| v_~get1~0.base_119) (+ v_~get1~0.offset_119 .cse8))) (.cse6 (select .cse0 (+ v_~get2~0.offset_141 .cse8)))) (and (= (ite (< .cse6 .cse7) (- 1) 1) v_~res2~0_146) (not (= .cse7 .cse6)) .cse5 (= v_thread2Thread1of1ForFork0_~stop~1_79 1) .cse4))))) (= |v_thread1Thread1of1ForFork1_#res.offset_65| 0))) InVars {~n2~0=v_~n2~0_124, ~n1~0=v_~n1~0_112, ~get2~0.base=v_~get2~0.base_141, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_145, ~get1~0.base=v_~get1~0.base_119, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_93, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_82|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_74|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_88|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_122|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_80, ~get2~0.offset=v_~get2~0.offset_141, #memory_int=|v_#memory_int_275|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_62|, ~get1~0.offset=v_~get1~0.offset_119, ~res2~0=v_~res2~0_145} OutVars{~res1~0=v_~res1~0_124, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_37|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_65|, ~n2~0=v_~n2~0_124, ~n1~0=v_~n1~0_112, ~get2~0.base=v_~get2~0.base_141, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_145, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_65|, ~get1~0.base=v_~get1~0.base_119, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_93, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_81|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_73|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_87|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_37|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_79, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_69|, ~get2~0.offset=v_~get2~0.offset_141, #memory_int=|v_#memory_int_275|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_89, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_61|, ~get1~0.offset=v_~get1~0.offset_119, ~res2~0=v_~res2~0_144} AuxVars[v_~res2~0_146] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:58,693 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:58,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1204 [2022-12-06 07:24:58,694 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 518 flow [2022-12-06 07:24:58,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:58,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:58,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:24:58,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash 379747148, now seen corresponding path program 4 times [2022-12-06 07:24:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:58,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906672575] [2022-12-06 07:24:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906672575] [2022-12-06 07:24:58,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906672575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:58,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:58,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061080796] [2022-12-06 07:24:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:58,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:58,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:24:58,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 518 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:58,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:24:58,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,141 INFO L130 PetriNetUnfolder]: 212/472 cut-off events. [2022-12-06 07:24:59,141 INFO L131 PetriNetUnfolder]: For 1397/1397 co-relation queries the response was YES. [2022-12-06 07:24:59,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 472 events. 212/472 cut-off events. For 1397/1397 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2352 event pairs, 118 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 1713. Up to 349 conditions per place. [2022-12-06 07:24:59,144 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 59 selfloop transitions, 8 changer transitions 11/79 dead transitions. [2022-12-06 07:24:59,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 626 flow [2022-12-06 07:24:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:24:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:24:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-12-06 07:24:59,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24324324324324326 [2022-12-06 07:24:59,145 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 518 flow. Second operand 8 states and 72 transitions. [2022-12-06 07:24:59,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 626 flow [2022-12-06 07:24:59,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 613 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:24:59,149 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 357 flow [2022-12-06 07:24:59,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=357, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2022-12-06 07:24:59,149 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 46 predicate places. [2022-12-06 07:24:59,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:59,150 INFO L89 Accepts]: Start accepts. Operand has 71 places, 46 transitions, 357 flow [2022-12-06 07:24:59,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:59,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:59,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 46 transitions, 357 flow [2022-12-06 07:24:59,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 46 transitions, 357 flow [2022-12-06 07:24:59,164 INFO L130 PetriNetUnfolder]: 24/145 cut-off events. [2022-12-06 07:24:59,164 INFO L131 PetriNetUnfolder]: For 310/317 co-relation queries the response was YES. [2022-12-06 07:24:59,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 145 events. 24/145 cut-off events. For 310/317 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 750 event pairs, 1 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 369. Up to 24 conditions per place. [2022-12-06 07:24:59,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 46 transitions, 357 flow [2022-12-06 07:24:59,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 07:24:59,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread2Thread1of1ForFork0_~stop~1_33 0) (= v_thread2Thread1of1ForFork0_~i~1_65 0) (= |v_thread1Thread1of1ForFork1_#res.base_35| 0) (= v_~count1~0_65 v_~count2~0_73) (= v_~res1~0_94 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_62| (select (select |v_#memory_int_237| v_~get2~0.base_109) (+ v_~get2~0.offset_109 (* v_thread1Thread1of1ForFork1_~i~0_99 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_47 1) (= |v_thread1Thread1of1ForFork1_#res.offset_35| 0)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_62|, ~count2~0=v_~count2~0_73, ~get2~0.offset=v_~get2~0.offset_109, ~count1~0=v_~count1~0_65, #memory_int=|v_#memory_int_237|, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99} OutVars{~res1~0=v_~res1~0_94, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_35|, ~count2~0=v_~count2~0_73, ~count1~0=v_~count1~0_65, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_35|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_65, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_33, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_39|, ~get2~0.offset=v_~get2~0.offset_109, #memory_int=|v_#memory_int_237|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_47} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:59,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse8 (select |v_#memory_int_271| v_~get2~0.base_137))) (and (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.offset_33| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.base_33| 0)) (.cse2 (= (mod v_thread2Thread1of1ForFork0_~stop~1_71 256) 0))) (or (and .cse0 (= v_~res2~0_133 v_~res2~0_131) .cse1 (not .cse2)) (and .cse0 .cse1 .cse2 (= (+ v_~n1~0_108 v_~res2~0_131) v_~n2~0_120)))) (= v_~count1~0_89 v_~count2~0_97) (= |v_thread1Thread1of1ForFork1_#res.base_61| 0) (= v_thread2Thread1of1ForFork0_~i~1_89 0) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_89 v_~n1~0_108)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_89 v_~n2~0_120))) (or (and (= v_thread2Thread1of1ForFork0_~stop~1_71 0) (= v_~res2~0_133 v_~res2~0_132) (= |v_thread2Thread1of1ForFork0_#t~mem9_66| |v_thread2Thread1of1ForFork0_#t~mem9_65|) (= |v_thread2Thread1of1ForFork0_#t~mem8_74| |v_thread2Thread1of1ForFork0_#t~mem8_73|) (= |v_thread2Thread1of1ForFork0_#t~mem10_54| |v_thread2Thread1of1ForFork0_#t~mem10_53|) (= |v_thread2Thread1of1ForFork0_#t~mem7_80| |v_thread2Thread1of1ForFork0_#t~mem7_79|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_89 4))) (let ((.cse5 (select .cse8 (+ v_~get2~0.offset_137 .cse7))) (.cse6 (select (select |v_#memory_int_271| v_~get1~0.base_115) (+ v_~get1~0.offset_115 .cse7)))) (and (= v_thread2Thread1of1ForFork0_~stop~1_71 1) (= v_~res2~0_133 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) .cse3 .cse4))))) (= v_thread1Thread1of1ForFork1_~stop~0_85 1) (= v_~res1~0_120 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_114| (select .cse8 (+ v_~get2~0.offset_137 (* v_thread1Thread1of1ForFork1_~i~0_141 4)))) (- 1) 1)) (= |v_thread1Thread1of1ForFork1_#res.offset_61| 0))) InVars {~n2~0=v_~n2~0_120, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_97, ~count1~0=v_~count1~0_89, ~get2~0.base=v_~get2~0.base_137, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_141, ~get1~0.base=v_~get1~0.base_115, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_74|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_66|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_80|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_114|, ~get2~0.offset=v_~get2~0.offset_137, #memory_int=|v_#memory_int_271|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_54|, ~get1~0.offset=v_~get1~0.offset_115, ~res2~0=v_~res2~0_132} OutVars{~res1~0=v_~res1~0_120, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_33|, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_97, ~get2~0.base=v_~get2~0.base_137, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_141, ~get1~0.base=v_~get1~0.base_115, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_33|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_65|, ~get2~0.offset=v_~get2~0.offset_137, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_85, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_53|, ~res2~0=v_~res2~0_131, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_61|, ~n2~0=v_~n2~0_120, ~count1~0=v_~count1~0_89, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_61|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_89, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_73|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_65|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_79|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_71, #memory_int=|v_#memory_int_271|, ~get1~0.offset=v_~get1~0.offset_115} AuxVars[v_~res2~0_133] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:59,462 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:24:59,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 07:24:59,463 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 357 flow [2022-12-06 07:24:59,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:59,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:59,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:59,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:24:59,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1820525386, now seen corresponding path program 3 times [2022-12-06 07:24:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019343683] [2022-12-06 07:24:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:59,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019343683] [2022-12-06 07:24:59,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019343683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:59,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:59,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:24:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91558289] [2022-12-06 07:24:59,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:59,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:59,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 07:24:59,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:59,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:59,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 07:24:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,865 INFO L130 PetriNetUnfolder]: 202/440 cut-off events. [2022-12-06 07:24:59,865 INFO L131 PetriNetUnfolder]: For 1330/1330 co-relation queries the response was YES. [2022-12-06 07:24:59,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 440 events. 202/440 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2099 event pairs, 111 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 1590. Up to 326 conditions per place. [2022-12-06 07:24:59,868 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 57 selfloop transitions, 4 changer transitions 20/82 dead transitions. [2022-12-06 07:24:59,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 644 flow [2022-12-06 07:24:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:24:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:24:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-06 07:24:59,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 07:24:59,869 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 357 flow. Second operand 7 states and 75 transitions. [2022-12-06 07:24:59,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 644 flow [2022-12-06 07:24:59,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 82 transitions, 629 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 07:24:59,875 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 349 flow [2022-12-06 07:24:59,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2022-12-06 07:24:59,877 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 49 predicate places. [2022-12-06 07:24:59,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:59,877 INFO L89 Accepts]: Start accepts. Operand has 74 places, 45 transitions, 349 flow [2022-12-06 07:24:59,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:59,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:59,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 45 transitions, 349 flow [2022-12-06 07:24:59,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 45 transitions, 349 flow [2022-12-06 07:24:59,888 INFO L130 PetriNetUnfolder]: 22/125 cut-off events. [2022-12-06 07:24:59,888 INFO L131 PetriNetUnfolder]: For 331/337 co-relation queries the response was YES. [2022-12-06 07:24:59,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 125 events. 22/125 cut-off events. For 331/337 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 591 event pairs, 1 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 338. Up to 21 conditions per place. [2022-12-06 07:24:59,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 45 transitions, 349 flow [2022-12-06 07:24:59,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 07:24:59,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_45| 0) (= v_thread1Thread1of1ForFork1_~stop~0_57 1) (= v_thread2Thread1of1ForFork0_~i~1_75 0) (= v_~count1~0_71 v_~count2~0_79) (= v_thread2Thread1of1ForFork0_~stop~1_51 0) (= |v_thread1Thread1of1ForFork1_#res.base_45| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_82| (select (select |v_#memory_int_255| v_~get2~0.base_121) (+ v_~get2~0.offset_121 (* v_thread1Thread1of1ForFork1_~i~0_109 4)))) (- 1) 1) v_~res1~0_104)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_82|, ~count2~0=v_~count2~0_79, ~get2~0.offset=v_~get2~0.offset_121, ~count1~0=v_~count1~0_71, #memory_int=|v_#memory_int_255|, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109} OutVars{~res1~0=v_~res1~0_104, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_45|, ~count2~0=v_~count2~0_79, ~count1~0=v_~count1~0_71, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_45|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_75, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_51, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_49|, ~get2~0.offset=v_~get2~0.offset_121, #memory_int=|v_#memory_int_255|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_57} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:24:59,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (select |v_#memory_int_253| v_~get2~0.base_119))) (and (let ((.cse0 (< v_thread2Thread1of1ForFork0_~i~1_73 v_~n2~0_112)) (.cse3 (< v_thread2Thread1of1ForFork0_~i~1_73 v_~n1~0_100))) (or (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_73 4))) (let ((.cse2 (select .cse5 (+ v_~get2~0.offset_119 .cse4))) (.cse1 (select (select |v_#memory_int_253| v_~get1~0.base_107) (+ v_~get1~0.offset_107 .cse4)))) (and .cse0 (not (= .cse1 .cse2)) (= v_thread2Thread1of1ForFork0_~stop~1_47 1) (= (ite (< .cse2 .cse1) (- 1) 1) v_~res2~0_105) .cse3))) (and (or (not .cse0) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem7_64| |v_thread2Thread1of1ForFork0_#t~mem7_63|) (= v_~res2~0_104 v_~res2~0_105) (= |v_thread2Thread1of1ForFork0_#t~mem9_49| |v_thread2Thread1of1ForFork0_#t~mem9_50|) (= |v_thread2Thread1of1ForFork0_#t~mem8_58| |v_thread2Thread1of1ForFork0_#t~mem8_57|) (= |v_thread2Thread1of1ForFork0_#t~mem10_38| |v_thread2Thread1of1ForFork0_#t~mem10_37|) (= v_thread2Thread1of1ForFork0_~stop~1_47 0)))) (= |v_thread1Thread1of1ForFork1_#res.base_43| 0) (let ((.cse6 (= |v_thread2Thread1of1ForFork0_#res.base_25| 0)) (.cse7 (= |v_thread2Thread1of1ForFork0_#res.offset_25| 0)) (.cse8 (= (mod v_thread2Thread1of1ForFork0_~stop~1_47 256) 0))) (or (and .cse6 .cse7 (= (+ v_~n1~0_100 v_~res2~0_103) v_~n2~0_112) .cse8) (and .cse6 .cse7 (not .cse8) (= v_~res2~0_103 v_~res2~0_105)))) (= v_thread2Thread1of1ForFork0_~i~1_73 0) (= v_~res1~0_102 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_78| (select .cse5 (+ v_~get2~0.offset_119 (* v_thread1Thread1of1ForFork1_~i~0_107 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_55 1) (= v_~count1~0_69 v_~count2~0_77) (= |v_thread1Thread1of1ForFork1_#res.offset_43| 0))) InVars {~n2~0=v_~n2~0_112, ~n1~0=v_~n1~0_100, ~count2~0=v_~count2~0_77, ~count1~0=v_~count1~0_69, ~get2~0.base=v_~get2~0.base_119, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~get1~0.base=v_~get1~0.base_107, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_58|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_50|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_64|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_78|, ~get2~0.offset=v_~get2~0.offset_119, #memory_int=|v_#memory_int_253|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_38|, ~get1~0.offset=v_~get1~0.offset_107, ~res2~0=v_~res2~0_104} OutVars{~res1~0=v_~res1~0_102, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_25|, ~n1~0=v_~n1~0_100, ~count2~0=v_~count2~0_77, ~get2~0.base=v_~get2~0.base_119, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_107, ~get1~0.base=v_~get1~0.base_107, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_25|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_47|, ~get2~0.offset=v_~get2~0.offset_119, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_55, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_37|, ~res2~0=v_~res2~0_103, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_43|, ~n2~0=v_~n2~0_112, ~count1~0=v_~count1~0_69, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_43|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_73, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_57|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_49|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_63|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_47, #memory_int=|v_#memory_int_253|, ~get1~0.offset=v_~get1~0.offset_107} AuxVars[v_~res2~0_105] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:25:00,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_45| 0) (= v_thread1Thread1of1ForFork1_~stop~0_57 1) (= v_thread2Thread1of1ForFork0_~i~1_75 0) (= v_~count1~0_71 v_~count2~0_79) (= v_thread2Thread1of1ForFork0_~stop~1_51 0) (= |v_thread1Thread1of1ForFork1_#res.base_45| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_82| (select (select |v_#memory_int_255| v_~get2~0.base_121) (+ v_~get2~0.offset_121 (* v_thread1Thread1of1ForFork1_~i~0_109 4)))) (- 1) 1) v_~res1~0_104)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_82|, ~count2~0=v_~count2~0_79, ~get2~0.offset=v_~get2~0.offset_121, ~count1~0=v_~count1~0_71, #memory_int=|v_#memory_int_255|, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109} OutVars{~res1~0=v_~res1~0_104, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_45|, ~count2~0=v_~count2~0_79, ~count1~0=v_~count1~0_71, ~get2~0.base=v_~get2~0.base_121, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_109, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_45|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_75, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_51, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_49|, ~get2~0.offset=v_~get2~0.offset_121, #memory_int=|v_#memory_int_255|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_57} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:00,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] $Ultimate##0-->L49-6: Formula: (and (= v_thread2Thread1of1ForFork0_~stop~1_101 0) (= v_~res1~0_142 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_158| (select (select |v_#memory_int_293| v_~get2~0.base_159) (+ v_~get2~0.offset_159 (* v_thread1Thread1of1ForFork1_~i~0_182 4)))) (- 1) 1)) (= |v_thread1Thread1of1ForFork1_#res.offset_83| 0) (= v_thread1Thread1of1ForFork1_~i~0_181 0) (= |v_thread1Thread1of1ForFork1_#res.base_83| 0) (= v_thread1Thread1of1ForFork1_~stop~0_125 0) (= v_~count1~0_109 v_~count2~0_117) (= v_thread2Thread1of1ForFork0_~i~1_109 0)) InVars {~count2~0=v_~count2~0_117, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_158|, ~count1~0=v_~count1~0_109, ~get2~0.offset=v_~get2~0.offset_159, #memory_int=|v_#memory_int_293|, ~get2~0.base=v_~get2~0.base_159, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_182} OutVars{~res1~0=v_~res1~0_142, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_83|, ~count2~0=v_~count2~0_117, ~count1~0=v_~count1~0_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_181, ~get2~0.base=v_~get2~0.base_159, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_83|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_109, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_101, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_87|, ~get2~0.offset=v_~get2~0.offset_159, #memory_int=|v_#memory_int_293|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_125} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:00,659 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:00,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 783 [2022-12-06 07:25:00,660 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 422 flow [2022-12-06 07:25:00,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:00,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:25:00,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 671743778, now seen corresponding path program 5 times [2022-12-06 07:25:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:00,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621914473] [2022-12-06 07:25:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621914473] [2022-12-06 07:25:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621914473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:00,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:25:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144111489] [2022-12-06 07:25:00,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:00,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:25:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:25:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:25:00,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 07:25:00,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 422 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:00,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 07:25:00,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:01,047 INFO L130 PetriNetUnfolder]: 185/389 cut-off events. [2022-12-06 07:25:01,047 INFO L131 PetriNetUnfolder]: For 1470/1470 co-relation queries the response was YES. [2022-12-06 07:25:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 389 events. 185/389 cut-off events. For 1470/1470 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1723 event pairs, 101 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1482. Up to 293 conditions per place. [2022-12-06 07:25:01,049 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 50 selfloop transitions, 6 changer transitions 16/73 dead transitions. [2022-12-06 07:25:01,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 583 flow [2022-12-06 07:25:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:25:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:25:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-06 07:25:01,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26515151515151514 [2022-12-06 07:25:01,050 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 422 flow. Second operand 8 states and 70 transitions. [2022-12-06 07:25:01,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 583 flow [2022-12-06 07:25:01,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 535 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-06 07:25:01,054 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 299 flow [2022-12-06 07:25:01,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2022-12-06 07:25:01,055 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 45 predicate places. [2022-12-06 07:25:01,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:01,055 INFO L89 Accepts]: Start accepts. Operand has 70 places, 42 transitions, 299 flow [2022-12-06 07:25:01,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:01,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:01,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 42 transitions, 299 flow [2022-12-06 07:25:01,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 42 transitions, 299 flow [2022-12-06 07:25:01,063 INFO L130 PetriNetUnfolder]: 20/105 cut-off events. [2022-12-06 07:25:01,063 INFO L131 PetriNetUnfolder]: For 199/203 co-relation queries the response was YES. [2022-12-06 07:25:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 105 events. 20/105 cut-off events. For 199/203 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 438 event pairs, 1 based on Foata normal form. 2/98 useless extension candidates. Maximal degree in co-relation 269. Up to 18 conditions per place. [2022-12-06 07:25:01,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 42 transitions, 299 flow [2022-12-06 07:25:01,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 07:25:01,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread2Thread1of1ForFork0_~stop~1_33 0) (= v_thread2Thread1of1ForFork0_~i~1_65 0) (= |v_thread1Thread1of1ForFork1_#res.base_35| 0) (= v_~count1~0_65 v_~count2~0_73) (= v_~res1~0_94 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_62| (select (select |v_#memory_int_237| v_~get2~0.base_109) (+ v_~get2~0.offset_109 (* v_thread1Thread1of1ForFork1_~i~0_99 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_47 1) (= |v_thread1Thread1of1ForFork1_#res.offset_35| 0)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_62|, ~count2~0=v_~count2~0_73, ~get2~0.offset=v_~get2~0.offset_109, ~count1~0=v_~count1~0_65, #memory_int=|v_#memory_int_237|, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99} OutVars{~res1~0=v_~res1~0_94, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_35|, ~count2~0=v_~count2~0_73, ~count1~0=v_~count1~0_65, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_35|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_65, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_33, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_39|, ~get2~0.offset=v_~get2~0.offset_109, #memory_int=|v_#memory_int_237|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_47} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:25:01,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse8 (select |v_#memory_int_271| v_~get2~0.base_137))) (and (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.offset_33| 0)) (.cse1 (= |v_thread2Thread1of1ForFork0_#res.base_33| 0)) (.cse2 (= (mod v_thread2Thread1of1ForFork0_~stop~1_71 256) 0))) (or (and .cse0 (= v_~res2~0_133 v_~res2~0_131) .cse1 (not .cse2)) (and .cse0 .cse1 .cse2 (= (+ v_~n1~0_108 v_~res2~0_131) v_~n2~0_120)))) (= v_~count1~0_89 v_~count2~0_97) (= |v_thread1Thread1of1ForFork1_#res.base_61| 0) (= v_thread2Thread1of1ForFork0_~i~1_89 0) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_89 v_~n1~0_108)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_89 v_~n2~0_120))) (or (and (= v_thread2Thread1of1ForFork0_~stop~1_71 0) (= v_~res2~0_133 v_~res2~0_132) (= |v_thread2Thread1of1ForFork0_#t~mem9_66| |v_thread2Thread1of1ForFork0_#t~mem9_65|) (= |v_thread2Thread1of1ForFork0_#t~mem8_74| |v_thread2Thread1of1ForFork0_#t~mem8_73|) (= |v_thread2Thread1of1ForFork0_#t~mem10_54| |v_thread2Thread1of1ForFork0_#t~mem10_53|) (= |v_thread2Thread1of1ForFork0_#t~mem7_80| |v_thread2Thread1of1ForFork0_#t~mem7_79|) (or (not .cse3) (not .cse4))) (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_89 4))) (let ((.cse5 (select .cse8 (+ v_~get2~0.offset_137 .cse7))) (.cse6 (select (select |v_#memory_int_271| v_~get1~0.base_115) (+ v_~get1~0.offset_115 .cse7)))) (and (= v_thread2Thread1of1ForFork0_~stop~1_71 1) (= v_~res2~0_133 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) .cse3 .cse4))))) (= v_thread1Thread1of1ForFork1_~stop~0_85 1) (= v_~res1~0_120 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_114| (select .cse8 (+ v_~get2~0.offset_137 (* v_thread1Thread1of1ForFork1_~i~0_141 4)))) (- 1) 1)) (= |v_thread1Thread1of1ForFork1_#res.offset_61| 0))) InVars {~n2~0=v_~n2~0_120, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_97, ~count1~0=v_~count1~0_89, ~get2~0.base=v_~get2~0.base_137, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_141, ~get1~0.base=v_~get1~0.base_115, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_74|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_66|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_80|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_114|, ~get2~0.offset=v_~get2~0.offset_137, #memory_int=|v_#memory_int_271|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_54|, ~get1~0.offset=v_~get1~0.offset_115, ~res2~0=v_~res2~0_132} OutVars{~res1~0=v_~res1~0_120, thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_33|, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_97, ~get2~0.base=v_~get2~0.base_137, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_141, ~get1~0.base=v_~get1~0.base_115, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_33|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_65|, ~get2~0.offset=v_~get2~0.offset_137, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_85, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_53|, ~res2~0=v_~res2~0_131, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_61|, ~n2~0=v_~n2~0_120, ~count1~0=v_~count1~0_89, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_61|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_89, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_73|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_65|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_79|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_71, #memory_int=|v_#memory_int_271|, ~get1~0.offset=v_~get1~0.offset_115} AuxVars[v_~res2~0_133] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [632] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= v_thread1Thread1of1ForFork1_~stop~0_17 0) (= v_~count1~0_19 v_~count2~0_17)) InVars {~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19} OutVars{~count2~0=v_~count2~0_17, ~count1~0=v_~count1~0_19, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_~stop~0] [2022-12-06 07:25:01,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread2Thread1of1ForFork0_~stop~1_33 0) (= v_thread2Thread1of1ForFork0_~i~1_65 0) (= |v_thread1Thread1of1ForFork1_#res.base_35| 0) (= v_~count1~0_65 v_~count2~0_73) (= v_~res1~0_94 (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_62| (select (select |v_#memory_int_237| v_~get2~0.base_109) (+ v_~get2~0.offset_109 (* v_thread1Thread1of1ForFork1_~i~0_99 4)))) (- 1) 1)) (= v_thread1Thread1of1ForFork1_~stop~0_47 1) (= |v_thread1Thread1of1ForFork1_#res.offset_35| 0)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_62|, ~count2~0=v_~count2~0_73, ~get2~0.offset=v_~get2~0.offset_109, ~count1~0=v_~count1~0_65, #memory_int=|v_#memory_int_237|, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99} OutVars{~res1~0=v_~res1~0_94, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_35|, ~count2~0=v_~count2~0_73, ~count1~0=v_~count1~0_65, ~get2~0.base=v_~get2~0.base_109, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_35|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_65, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_33, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_39|, ~get2~0.offset=v_~get2~0.offset_109, #memory_int=|v_#memory_int_237|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_47} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:01,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] $Ultimate##0-->L49-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_117 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_174| (select (select |v_#memory_int_301| v_~get2~0.base_167) (+ v_~get2~0.offset_167 (* v_thread1Thread1of1ForFork1_~i~0_196 4)))) (- 1) 1) v_~res1~0_150) (= |v_thread1Thread1of1ForFork1_#res.base_91| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_91| 0) (= v_~count1~0_117 v_~count2~0_125) (= v_thread1Thread1of1ForFork1_~i~0_195 0) (= v_thread1Thread1of1ForFork1_~stop~0_137 0) (= v_thread2Thread1of1ForFork0_~stop~1_113 0)) InVars {~count2~0=v_~count2~0_125, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_174|, ~count1~0=v_~count1~0_117, ~get2~0.offset=v_~get2~0.offset_167, #memory_int=|v_#memory_int_301|, ~get2~0.base=v_~get2~0.base_167, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_196} OutVars{~res1~0=v_~res1~0_150, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_91|, ~count2~0=v_~count2~0_125, ~count1~0=v_~count1~0_117, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_195, ~get2~0.base=v_~get2~0.base_167, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_91|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_117, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_113, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_95|, ~get2~0.offset=v_~get2~0.offset_167, #memory_int=|v_#memory_int_301|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_137} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_~i~1, thread1Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:01,799 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:01,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 745 [2022-12-06 07:25:01,800 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 373 flow [2022-12-06 07:25:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:01,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:01,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:01,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:25:01,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1537256618, now seen corresponding path program 1 times [2022-12-06 07:25:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:01,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209335395] [2022-12-06 07:25:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209335395] [2022-12-06 07:25:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209335395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:01,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:01,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23058962] [2022-12-06 07:25:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:01,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:01,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:01,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:25:01,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:01,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:01,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:25:01,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:02,015 INFO L130 PetriNetUnfolder]: 256/492 cut-off events. [2022-12-06 07:25:02,015 INFO L131 PetriNetUnfolder]: For 1478/1478 co-relation queries the response was YES. [2022-12-06 07:25:02,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 492 events. 256/492 cut-off events. For 1478/1478 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2004 event pairs, 132 based on Foata normal form. 8/464 useless extension candidates. Maximal degree in co-relation 1791. Up to 242 conditions per place. [2022-12-06 07:25:02,018 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 69 selfloop transitions, 6 changer transitions 2/77 dead transitions. [2022-12-06 07:25:02,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 619 flow [2022-12-06 07:25:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 07:25:02,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:25:02,018 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 373 flow. Second operand 5 states and 66 transitions. [2022-12-06 07:25:02,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 619 flow [2022-12-06 07:25:02,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 549 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-06 07:25:02,022 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2022-12-06 07:25:02,022 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 34 predicate places. [2022-12-06 07:25:02,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:02,022 INFO L89 Accepts]: Start accepts. Operand has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:02,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:02,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,031 INFO L130 PetriNetUnfolder]: 21/113 cut-off events. [2022-12-06 07:25:02,031 INFO L131 PetriNetUnfolder]: For 117/121 co-relation queries the response was YES. [2022-12-06 07:25:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 113 events. 21/113 cut-off events. For 117/121 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 489 event pairs, 1 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 244. Up to 19 conditions per place. [2022-12-06 07:25:02,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 07:25:02,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:02,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:25:02,036 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 276 flow [2022-12-06 07:25:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:02,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:02,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:25:02,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1385549450, now seen corresponding path program 1 times [2022-12-06 07:25:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241656903] [2022-12-06 07:25:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:02,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241656903] [2022-12-06 07:25:02,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241656903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:02,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:02,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234488395] [2022-12-06 07:25:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:02,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:02,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:25:02,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:02,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:25:02,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:02,178 INFO L130 PetriNetUnfolder]: 188/366 cut-off events. [2022-12-06 07:25:02,179 INFO L131 PetriNetUnfolder]: For 759/759 co-relation queries the response was YES. [2022-12-06 07:25:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 366 events. 188/366 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1338 event pairs, 114 based on Foata normal form. 12/374 useless extension candidates. Maximal degree in co-relation 1146. Up to 309 conditions per place. [2022-12-06 07:25:02,180 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 33 selfloop transitions, 0 changer transitions 17/50 dead transitions. [2022-12-06 07:25:02,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 373 flow [2022-12-06 07:25:02,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 07:25:02,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 07:25:02,182 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 276 flow. Second operand 4 states and 43 transitions. [2022-12-06 07:25:02,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 373 flow [2022-12-06 07:25:02,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 348 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:02,184 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 181 flow [2022-12-06 07:25:02,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2022-12-06 07:25:02,184 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 28 predicate places. [2022-12-06 07:25:02,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:02,184 INFO L89 Accepts]: Start accepts. Operand has 53 places, 33 transitions, 181 flow [2022-12-06 07:25:02,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:02,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:02,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 33 transitions, 181 flow [2022-12-06 07:25:02,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 181 flow [2022-12-06 07:25:02,192 INFO L130 PetriNetUnfolder]: 15/67 cut-off events. [2022-12-06 07:25:02,192 INFO L131 PetriNetUnfolder]: For 54/56 co-relation queries the response was YES. [2022-12-06 07:25:02,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 67 events. 15/67 cut-off events. For 54/56 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 138. Up to 13 conditions per place. [2022-12-06 07:25:02,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 181 flow [2022-12-06 07:25:02,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 07:25:02,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:02,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:25:02,194 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 181 flow [2022-12-06 07:25:02,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:02,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:02,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:25:02,195 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 951553014, now seen corresponding path program 1 times [2022-12-06 07:25:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:02,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643731712] [2022-12-06 07:25:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:02,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643731712] [2022-12-06 07:25:02,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643731712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:02,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:02,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286176043] [2022-12-06 07:25:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:02,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:02,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:02,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:25:02,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:02,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:25:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:02,310 INFO L130 PetriNetUnfolder]: 151/274 cut-off events. [2022-12-06 07:25:02,310 INFO L131 PetriNetUnfolder]: For 551/551 co-relation queries the response was YES. [2022-12-06 07:25:02,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 274 events. 151/274 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 851 event pairs, 90 based on Foata normal form. 4/275 useless extension candidates. Maximal degree in co-relation 842. Up to 252 conditions per place. [2022-12-06 07:25:02,311 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 29 selfloop transitions, 0 changer transitions 14/43 dead transitions. [2022-12-06 07:25:02,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 280 flow [2022-12-06 07:25:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:25:02,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 07:25:02,312 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 181 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:25:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 280 flow [2022-12-06 07:25:02,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 255 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 07:25:02,314 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 122 flow [2022-12-06 07:25:02,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-06 07:25:02,315 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 07:25:02,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:02,315 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 122 flow [2022-12-06 07:25:02,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:02,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:02,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 122 flow [2022-12-06 07:25:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 122 flow [2022-12-06 07:25:02,320 INFO L130 PetriNetUnfolder]: 12/46 cut-off events. [2022-12-06 07:25:02,320 INFO L131 PetriNetUnfolder]: For 19/20 co-relation queries the response was YES. [2022-12-06 07:25:02,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 46 events. 12/46 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2022-12-06 07:25:02,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 122 flow [2022-12-06 07:25:02,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 07:25:02,321 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:02,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:25:02,322 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 122 flow [2022-12-06 07:25:02,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:02,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:02,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:02,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:25:02,322 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 235963187, now seen corresponding path program 1 times [2022-12-06 07:25:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:02,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520341272] [2022-12-06 07:25:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:02,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520341272] [2022-12-06 07:25:02,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520341272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:02,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208643101] [2022-12-06 07:25:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:02,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:02,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:02,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:25:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:02,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:25:02,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:02,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:25:03,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:25:03,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:25:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:03,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:03,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:03,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-12-06 07:25:03,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:03,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 546 [2022-12-06 07:25:03,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:03,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 511 [2022-12-06 07:25:03,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:03,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 447 [2022-12-06 07:25:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:03,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208643101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:03,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:03,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-12-06 07:25:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758896701] [2022-12-06 07:25:03,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:25:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:25:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=333, Unknown=27, NotChecked=0, Total=462 [2022-12-06 07:25:03,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:25:03,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 122 flow. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:03,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:03,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:25:03,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:04,207 INFO L130 PetriNetUnfolder]: 253/429 cut-off events. [2022-12-06 07:25:04,207 INFO L131 PetriNetUnfolder]: For 381/381 co-relation queries the response was YES. [2022-12-06 07:25:04,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 429 events. 253/429 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1585 event pairs, 50 based on Foata normal form. 12/439 useless extension candidates. Maximal degree in co-relation 1113. Up to 131 conditions per place. [2022-12-06 07:25:04,209 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 70 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2022-12-06 07:25:04,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 83 transitions, 491 flow [2022-12-06 07:25:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:25:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:25:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-06 07:25:04,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.357487922705314 [2022-12-06 07:25:04,210 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 122 flow. Second operand 9 states and 74 transitions. [2022-12-06 07:25:04,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 83 transitions, 491 flow [2022-12-06 07:25:04,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 83 transitions, 468 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:04,211 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 192 flow [2022-12-06 07:25:04,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-06 07:25:04,212 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2022-12-06 07:25:04,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:04,212 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 192 flow [2022-12-06 07:25:04,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:04,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:04,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 192 flow [2022-12-06 07:25:04,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 192 flow [2022-12-06 07:25:04,219 INFO L130 PetriNetUnfolder]: 27/97 cut-off events. [2022-12-06 07:25:04,219 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 07:25:04,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 97 events. 27/97 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 349 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 210. Up to 20 conditions per place. [2022-12-06 07:25:04,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 192 flow [2022-12-06 07:25:04,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 07:25:04,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] L49-6-->L50-1: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_27 v_~n2~0_20) (= (select (select |v_#memory_int_49| v_~get1~0.base_11) (+ v_~get1~0.offset_11 (* v_thread1Thread1of1ForFork1_~i~0_27 4))) |v_thread1Thread1of1ForFork1_#t~mem2_25|) (< v_thread1Thread1of1ForFork1_~i~0_27 v_~n1~0_20)) InVars {~n2~0=v_~n2~0_20, ~n1~0=v_~n1~0_20, #memory_int=|v_#memory_int_49|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_27, ~get1~0.offset=v_~get1~0.offset_11, ~get1~0.base=v_~get1~0.base_11} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_25|, ~n2~0=v_~n2~0_20, ~n1~0=v_~n1~0_20, #memory_int=|v_#memory_int_49|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_27, ~get1~0.offset=v_~get1~0.offset_11, ~get1~0.base=v_~get1~0.base_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:04,334 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:04,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 07:25:04,335 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 188 flow [2022-12-06 07:25:04,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:04,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:04,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:04,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:04,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:25:04,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1709805700, now seen corresponding path program 1 times [2022-12-06 07:25:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:04,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252231320] [2022-12-06 07:25:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:04,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252231320] [2022-12-06 07:25:04,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252231320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:04,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41987931] [2022-12-06 07:25:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:04,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:04,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:25:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:04,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 07:25:04,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:04,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:25:04,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:25:04,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:25:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:05,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:05,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:05,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-12-06 07:25:05,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:05,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 274 [2022-12-06 07:25:05,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:05,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 239 [2022-12-06 07:25:05,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:05,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 223 [2022-12-06 07:25:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:05,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41987931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:05,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:05,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-12-06 07:25:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6074299] [2022-12-06 07:25:05,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:05,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:25:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:25:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=221, Unknown=12, NotChecked=0, Total=306 [2022-12-06 07:25:05,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:25:05,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 188 flow. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:05,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:05,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:25:05,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:05,700 INFO L130 PetriNetUnfolder]: 252/434 cut-off events. [2022-12-06 07:25:05,700 INFO L131 PetriNetUnfolder]: For 810/810 co-relation queries the response was YES. [2022-12-06 07:25:05,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 434 events. 252/434 cut-off events. For 810/810 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1641 event pairs, 83 based on Foata normal form. 10/444 useless extension candidates. Maximal degree in co-relation 935. Up to 229 conditions per place. [2022-12-06 07:25:05,702 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 64 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2022-12-06 07:25:05,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 534 flow [2022-12-06 07:25:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:25:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:25:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-12-06 07:25:05,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 07:25:05,703 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 188 flow. Second operand 8 states and 65 transitions. [2022-12-06 07:25:05,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 534 flow [2022-12-06 07:25:05,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 491 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:05,706 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 240 flow [2022-12-06 07:25:05,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 07:25:05,706 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2022-12-06 07:25:05,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:05,706 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 240 flow [2022-12-06 07:25:05,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:05,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:05,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 240 flow [2022-12-06 07:25:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 240 flow [2022-12-06 07:25:05,717 INFO L130 PetriNetUnfolder]: 36/116 cut-off events. [2022-12-06 07:25:05,717 INFO L131 PetriNetUnfolder]: For 134/138 co-relation queries the response was YES. [2022-12-06 07:25:05,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 116 events. 36/116 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 447 event pairs, 1 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 284. Up to 26 conditions per place. [2022-12-06 07:25:05,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 240 flow [2022-12-06 07:25:05,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 07:25:05,780 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:05,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 07:25:05,783 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 238 flow [2022-12-06 07:25:05,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:05,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:05,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:05,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:25:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:25:05,988 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2047460907, now seen corresponding path program 1 times [2022-12-06 07:25:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:05,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060961042] [2022-12-06 07:25:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060961042] [2022-12-06 07:25:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060961042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:06,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:25:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804613060] [2022-12-06 07:25:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:06,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:25:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:25:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:25:06,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:25:06,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 238 flow. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:06,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:06,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:25:06,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:06,622 INFO L130 PetriNetUnfolder]: 517/888 cut-off events. [2022-12-06 07:25:06,622 INFO L131 PetriNetUnfolder]: For 2347/2347 co-relation queries the response was YES. [2022-12-06 07:25:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 888 events. 517/888 cut-off events. For 2347/2347 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4087 event pairs, 77 based on Foata normal form. 28/916 useless extension candidates. Maximal degree in co-relation 2021. Up to 279 conditions per place. [2022-12-06 07:25:06,627 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 101 selfloop transitions, 19 changer transitions 6/126 dead transitions. [2022-12-06 07:25:06,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 126 transitions, 1050 flow [2022-12-06 07:25:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:25:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:25:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-12-06 07:25:06,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-06 07:25:06,628 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 238 flow. Second operand 9 states and 99 transitions. [2022-12-06 07:25:06,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 126 transitions, 1050 flow [2022-12-06 07:25:06,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 126 transitions, 972 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:06,634 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 405 flow [2022-12-06 07:25:06,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=405, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2022-12-06 07:25:06,635 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 29 predicate places. [2022-12-06 07:25:06,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:06,635 INFO L89 Accepts]: Start accepts. Operand has 54 places, 55 transitions, 405 flow [2022-12-06 07:25:06,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:06,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:06,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 405 flow [2022-12-06 07:25:06,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 405 flow [2022-12-06 07:25:06,660 INFO L130 PetriNetUnfolder]: 80/273 cut-off events. [2022-12-06 07:25:06,660 INFO L131 PetriNetUnfolder]: For 499/509 co-relation queries the response was YES. [2022-12-06 07:25:06,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 273 events. 80/273 cut-off events. For 499/509 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1554 event pairs, 2 based on Foata normal form. 5/273 useless extension candidates. Maximal degree in co-relation 697. Up to 60 conditions per place. [2022-12-06 07:25:06,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 405 flow [2022-12-06 07:25:06,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 07:25:09,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L51-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (= (ite (< |v_thread1Thread1of1ForFork1_#t~mem4_36| (select (select |v_#memory_int_177| v_~get2~0.base_79) (+ v_~get2~0.offset_79 (* v_thread1Thread1of1ForFork1_~i~0_71 4)))) (- 1) 1) v_~res1~0_66) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (= v_thread1Thread1of1ForFork1_~stop~0_33 1)) InVars {thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_36|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71} OutVars{~res1~0=v_~res1~0_66, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_29|, ~get2~0.offset=v_~get2~0.offset_79, #memory_int=|v_#memory_int_177|, ~get2~0.base=v_~get2~0.base_79, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_33} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:12,216 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:12,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5581 [2022-12-06 07:25:12,217 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 428 flow [2022-12-06 07:25:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:12,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:12,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:12,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:25:12,217 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1964670732, now seen corresponding path program 1 times [2022-12-06 07:25:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:12,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281430805] [2022-12-06 07:25:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281430805] [2022-12-06 07:25:12,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281430805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:12,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:12,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:25:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142849511] [2022-12-06 07:25:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:25:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:25:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:25:12,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:25:12,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 428 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:12,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:12,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:25:12,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:13,277 INFO L130 PetriNetUnfolder]: 555/1016 cut-off events. [2022-12-06 07:25:13,277 INFO L131 PetriNetUnfolder]: For 3040/3040 co-relation queries the response was YES. [2022-12-06 07:25:13,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 1016 events. 555/1016 cut-off events. For 3040/3040 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5276 event pairs, 215 based on Foata normal form. 3/1016 useless extension candidates. Maximal degree in co-relation 3469. Up to 409 conditions per place. [2022-12-06 07:25:13,283 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 100 selfloop transitions, 18 changer transitions 7/125 dead transitions. [2022-12-06 07:25:13,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 125 transitions, 1079 flow [2022-12-06 07:25:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:25:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:25:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 07:25:13,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2022-12-06 07:25:13,284 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 428 flow. Second operand 8 states and 89 transitions. [2022-12-06 07:25:13,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 125 transitions, 1079 flow [2022-12-06 07:25:13,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 125 transitions, 1049 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:13,292 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 602 flow [2022-12-06 07:25:13,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=602, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2022-12-06 07:25:13,292 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 41 predicate places. [2022-12-06 07:25:13,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:13,292 INFO L89 Accepts]: Start accepts. Operand has 66 places, 67 transitions, 602 flow [2022-12-06 07:25:13,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:13,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:13,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 67 transitions, 602 flow [2022-12-06 07:25:13,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 67 transitions, 602 flow [2022-12-06 07:25:13,315 INFO L130 PetriNetUnfolder]: 83/312 cut-off events. [2022-12-06 07:25:13,315 INFO L131 PetriNetUnfolder]: For 866/895 co-relation queries the response was YES. [2022-12-06 07:25:13,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 312 events. 83/312 cut-off events. For 866/895 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1993 event pairs, 2 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 1124. Up to 64 conditions per place. [2022-12-06 07:25:13,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 67 transitions, 602 flow [2022-12-06 07:25:13,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 07:25:13,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L49-6-->L51-1: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork1_~i~0_239 4))) (let ((.cse0 (select (select |v_#memory_int_353| v_~get1~0.base_157) (+ v_~get1~0.offset_157 .cse1)))) (and (= |v_thread1Thread1of1ForFork1_#t~mem4_195| .cse0) (< v_thread1Thread1of1ForFork1_~i~0_239 v_~n2~0_158) (< v_thread1Thread1of1ForFork1_~i~0_239 v_~n1~0_146) (not (= .cse0 (select (select |v_#memory_int_353| v_~get2~0.base_196) (+ v_~get2~0.offset_196 .cse1))))))) InVars {~n2~0=v_~n2~0_158, ~n1~0=v_~n1~0_146, ~get2~0.offset=v_~get2~0.offset_196, #memory_int=|v_#memory_int_353|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_239, ~get2~0.base=v_~get2~0.base_196, ~get1~0.offset=v_~get1~0.offset_157, ~get1~0.base=v_~get1~0.base_157} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_118|, ~n2~0=v_~n2~0_158, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_104|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_195|, ~n1~0=v_~n1~0_146, ~get2~0.offset=v_~get2~0.offset_196, #memory_int=|v_#memory_int_353|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_239, ~get2~0.base=v_~get2~0.base_196, ~get1~0.offset=v_~get1~0.offset_157, ~get1~0.base=v_~get1~0.base_157} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4] and [729] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork0_~i~1_59 0) (= v_~count1~0_37 v_~count2~0_35) (= v_thread2Thread1of1ForFork0_~stop~1_19 0)) InVars {~count2~0=v_~count2~0_35, ~count1~0=v_~count1~0_37} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_59, ~count2~0=v_~count2~0_35, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_19, ~count1~0=v_~count1~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_~stop~1] [2022-12-06 07:25:13,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L49-6-->L51-1: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork1_~i~0_239 4))) (let ((.cse0 (select (select |v_#memory_int_353| v_~get1~0.base_157) (+ v_~get1~0.offset_157 .cse1)))) (and (= |v_thread1Thread1of1ForFork1_#t~mem4_195| .cse0) (< v_thread1Thread1of1ForFork1_~i~0_239 v_~n2~0_158) (< v_thread1Thread1of1ForFork1_~i~0_239 v_~n1~0_146) (not (= .cse0 (select (select |v_#memory_int_353| v_~get2~0.base_196) (+ v_~get2~0.offset_196 .cse1))))))) InVars {~n2~0=v_~n2~0_158, ~n1~0=v_~n1~0_146, ~get2~0.offset=v_~get2~0.offset_196, #memory_int=|v_#memory_int_353|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_239, ~get2~0.base=v_~get2~0.base_196, ~get1~0.offset=v_~get1~0.offset_157, ~get1~0.base=v_~get1~0.base_157} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_118|, ~n2~0=v_~n2~0_158, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_104|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_195|, ~n1~0=v_~n1~0_146, ~get2~0.offset=v_~get2~0.offset_196, #memory_int=|v_#memory_int_353|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_239, ~get2~0.base=v_~get2~0.base_196, ~get1~0.offset=v_~get1~0.offset_157, ~get1~0.base=v_~get1~0.base_157} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:13,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [839] L49-6-->thread1EXIT: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_245 4))) (let ((.cse0 (select (select |v_#memory_int_385| v_~get1~0.base_175) (+ v_~get1~0.offset_175 .cse2))) (.cse1 (select (select |v_#memory_int_385| v_~get2~0.base_214) (+ v_~get2~0.offset_214 .cse2)))) (and (< v_thread1Thread1of1ForFork1_~i~0_245 v_~n2~0_174) (= v_thread1Thread1of1ForFork1_~stop~0_155 1) (= |v_thread1Thread1of1ForFork1_#res.offset_105| 0) (not (= .cse0 .cse1)) (= |v_thread1Thread1of1ForFork1_#res.base_105| 0) (= v_~res1~0_170 (ite (< .cse0 .cse1) (- 1) 1)) (< v_thread1Thread1of1ForFork1_~i~0_245 v_~n1~0_162)))) InVars {~n2~0=v_~n2~0_174, ~n1~0=v_~n1~0_162, ~get2~0.offset=v_~get2~0.offset_214, #memory_int=|v_#memory_int_385|, ~get2~0.base=v_~get2~0.base_214, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_245, ~get1~0.offset=v_~get1~0.offset_175, ~get1~0.base=v_~get1~0.base_175} OutVars{~res1~0=v_~res1~0_170, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_105|, ~n2~0=v_~n2~0_174, ~n1~0=v_~n1~0_162, ~get2~0.base=v_~get2~0.base_214, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_245, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_105|, ~get1~0.base=v_~get1~0.base_175, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_124|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_108|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_203|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_107|, ~get2~0.offset=v_~get2~0.offset_214, #memory_int=|v_#memory_int_385|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_155, ~get1~0.offset=v_~get1~0.offset_175} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [782] L69-6-->thread2EXIT: Formula: (and (let ((.cse1 (= |v_thread2Thread1of1ForFork0_#res.offset_17| 0)) (.cse0 (= (mod v_thread2Thread1of1ForFork0_~stop~1_27 256) 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res.base_17| 0))) (or (and (not .cse0) .cse1 (= v_~res2~0_67 v_~res2~0_66) .cse2) (and .cse1 .cse0 (= v_~n2~0_90 (+ v_~n1~0_82 v_~res2~0_66)) .cse2))) (let ((.cse3 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n2~0_90)) (.cse4 (< v_thread2Thread1of1ForFork0_~i~1_61 v_~n1~0_82))) (or (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_61 4))) (let ((.cse6 (select (select |v_#memory_int_189| v_~get2~0.base_85) (+ v_~get2~0.offset_85 .cse7))) (.cse5 (select (select |v_#memory_int_189| v_~get1~0.base_79) (+ v_~get1~0.offset_79 .cse7)))) (and .cse3 .cse4 (not (= .cse5 .cse6)) (= v_thread2Thread1of1ForFork0_~stop~1_27 1) (= (ite (< .cse6 .cse5) (- 1) 1) v_~res2~0_67)))) (and (= |v_thread2Thread1of1ForFork0_#t~mem10_21| |v_thread2Thread1of1ForFork0_#t~mem10_22|) (= |v_thread2Thread1of1ForFork0_#t~mem8_42| |v_thread2Thread1of1ForFork0_#t~mem8_41|) (= |v_thread2Thread1of1ForFork0_#t~mem9_34| |v_thread2Thread1of1ForFork0_#t~mem9_33|) (= |v_thread2Thread1of1ForFork0_#t~mem7_48| |v_thread2Thread1of1ForFork0_#t~mem7_47|) (= v_~res2~0_68 v_~res2~0_67) (= v_thread2Thread1of1ForFork0_~stop~1_28 v_thread2Thread1of1ForFork0_~stop~1_27) (or (not .cse3) (not .cse4)))))) InVars {~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_42|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_34|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_48|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_28, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_22|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_17|, ~n2~0=v_~n2~0_90, ~n1~0=v_~n1~0_82, ~get2~0.base=v_~get2~0.base_85, ~get1~0.base=v_~get1~0.base_79, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_61, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_41|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_33|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_47|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_17|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_27, ~get2~0.offset=v_~get2~0.offset_85, #memory_int=|v_#memory_int_189|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_21|, ~get1~0.offset=v_~get1~0.offset_79, ~res2~0=v_~res2~0_66} AuxVars[v_~res2~0_67] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_~stop~1, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] [2022-12-06 07:25:13,813 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:13,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 07:25:13,814 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 626 flow [2022-12-06 07:25:13,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:13,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:13,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:13,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:25:13,814 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 240584264, now seen corresponding path program 1 times [2022-12-06 07:25:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037735876] [2022-12-06 07:25:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:14,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037735876] [2022-12-06 07:25:14,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037735876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:14,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:14,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873326998] [2022-12-06 07:25:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:14,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:25:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:25:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:14,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:25:14,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 626 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:14,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:14,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:25:14,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:14,395 INFO L130 PetriNetUnfolder]: 547/1022 cut-off events. [2022-12-06 07:25:14,395 INFO L131 PetriNetUnfolder]: For 3926/3926 co-relation queries the response was YES. [2022-12-06 07:25:14,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1022 events. 547/1022 cut-off events. For 3926/3926 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5457 event pairs, 220 based on Foata normal form. 5/1026 useless extension candidates. Maximal degree in co-relation 4583. Up to 408 conditions per place. [2022-12-06 07:25:14,405 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 98 selfloop transitions, 15 changer transitions 10/123 dead transitions. [2022-12-06 07:25:14,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1192 flow [2022-12-06 07:25:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 07:25:14,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 07:25:14,406 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 626 flow. Second operand 7 states and 91 transitions. [2022-12-06 07:25:14,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1192 flow [2022-12-06 07:25:14,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 1150 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:14,415 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 653 flow [2022-12-06 07:25:14,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2022-12-06 07:25:14,416 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2022-12-06 07:25:14,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:14,416 INFO L89 Accepts]: Start accepts. Operand has 68 places, 67 transitions, 653 flow [2022-12-06 07:25:14,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:14,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:14,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 653 flow [2022-12-06 07:25:14,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 653 flow [2022-12-06 07:25:14,440 INFO L130 PetriNetUnfolder]: 82/335 cut-off events. [2022-12-06 07:25:14,441 INFO L131 PetriNetUnfolder]: For 1062/1083 co-relation queries the response was YES. [2022-12-06 07:25:14,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 335 events. 82/335 cut-off events. For 1062/1083 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2261 event pairs, 1 based on Foata normal form. 9/338 useless extension candidates. Maximal degree in co-relation 1172. Up to 67 conditions per place. [2022-12-06 07:25:14,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 653 flow [2022-12-06 07:25:14,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 07:25:14,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L49-6-->thread1EXIT: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_249 4))) (let ((.cse0 (select (select |v_#memory_int_389| v_~get1~0.base_179) (+ .cse2 v_~get1~0.offset_179))) (.cse1 (select (select |v_#memory_int_389| v_~get2~0.base_218) (+ v_~get2~0.offset_218 .cse2)))) (and (not (= .cse0 .cse1)) (= |v_thread1Thread1of1ForFork1_#res.offset_109| 0) (< v_thread1Thread1of1ForFork1_~i~0_249 v_~n1~0_166) (= |v_thread1Thread1of1ForFork1_#res.base_109| 0) (= v_thread1Thread1of1ForFork1_~stop~0_159 1) (= v_~res1~0_174 (ite (< .cse0 .cse1) (- 1) 1)) (< v_thread1Thread1of1ForFork1_~i~0_249 v_~n2~0_178)))) InVars {~n2~0=v_~n2~0_178, ~n1~0=v_~n1~0_166, ~get2~0.offset=v_~get2~0.offset_218, #memory_int=|v_#memory_int_389|, ~get2~0.base=v_~get2~0.base_218, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_249, ~get1~0.offset=v_~get1~0.offset_179, ~get1~0.base=v_~get1~0.base_179} OutVars{~res1~0=v_~res1~0_174, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_109|, ~n2~0=v_~n2~0_178, ~n1~0=v_~n1~0_166, ~get2~0.base=v_~get2~0.base_218, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_249, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_109|, ~get1~0.base=v_~get1~0.base_179, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_128|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_112|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_211|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_111|, ~get2~0.offset=v_~get2~0.offset_218, #memory_int=|v_#memory_int_389|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_159, ~get1~0.offset=v_~get1~0.offset_179} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:14,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [843] L49-6-->thread1EXIT: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_253 4))) (let ((.cse0 (select (select |v_#memory_int_395| v_~get1~0.base_183) (+ v_~get1~0.offset_183 .cse2))) (.cse1 (select (select |v_#memory_int_395| v_~get2~0.base_222) (+ v_~get2~0.offset_222 .cse2)))) (and (not (= .cse0 .cse1)) (= |v_thread1Thread1of1ForFork1_#res.offset_111| 0) (= |v_thread1Thread1of1ForFork1_#res.base_111| 0) (= v_thread1Thread1of1ForFork1_~stop~0_161 1) (< v_thread1Thread1of1ForFork1_~i~0_253 v_~n1~0_170) (< v_thread1Thread1of1ForFork1_~i~0_253 v_~n2~0_182) (= v_~res1~0_176 (ite (< .cse0 .cse1) (- 1) 1))))) InVars {~n2~0=v_~n2~0_182, ~n1~0=v_~n1~0_170, ~get2~0.offset=v_~get2~0.offset_222, #memory_int=|v_#memory_int_395|, ~get2~0.base=v_~get2~0.base_222, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_253, ~get1~0.offset=v_~get1~0.offset_183, ~get1~0.base=v_~get1~0.base_183} OutVars{~res1~0=v_~res1~0_176, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_111|, ~n2~0=v_~n2~0_182, ~n1~0=v_~n1~0_170, ~get2~0.base=v_~get2~0.base_222, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_253, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_111|, ~get1~0.base=v_~get1~0.base_183, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_132|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_116|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_217|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_113|, ~get2~0.offset=v_~get2~0.offset_222, #memory_int=|v_#memory_int_395|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_161, ~get1~0.offset=v_~get1~0.offset_183} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:14,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [844] L49-6-->thread2EXIT: Formula: (let ((.cse6 (select |v_#memory_int_397| v_~get2~0.base_224)) (.cse4 (select |v_#memory_int_397| v_~get1~0.base_185)) (.cse12 (* v_thread1Thread1of1ForFork1_~i~0_255 4))) (let ((.cse7 (select .cse4 (+ v_~get1~0.offset_185 .cse12))) (.cse8 (select .cse6 (+ v_~get2~0.offset_224 .cse12)))) (and (< v_thread1Thread1of1ForFork1_~i~0_255 v_~n2~0_184) (let ((.cse2 (< v_thread2Thread1of1ForFork0_~i~1_141 v_~n2~0_184)) (.cse3 (< v_thread2Thread1of1ForFork0_~i~1_141 v_~n1~0_172))) (or (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_141 4))) (let ((.cse0 (select .cse6 (+ v_~get2~0.offset_224 .cse5))) (.cse1 (select .cse4 (+ v_~get1~0.offset_185 .cse5)))) (and (= v_thread2Thread1of1ForFork0_~stop~1_143 1) (= v_~res2~0_246 (ite (< .cse0 .cse1) (- 1) 1)) .cse2 .cse3 (not (= .cse0 .cse1))))) (and (= |v_thread2Thread1of1ForFork0_#t~mem8_139| |v_thread2Thread1of1ForFork0_#t~mem8_140|) (= |v_thread2Thread1of1ForFork0_#t~mem7_146| |v_thread2Thread1of1ForFork0_#t~mem7_145|) (or (not .cse2) (not .cse3)) (= |v_thread2Thread1of1ForFork0_#t~mem9_128| |v_thread2Thread1of1ForFork0_#t~mem9_127|) (= v_~res2~0_246 v_~res2~0_245) (= v_thread2Thread1of1ForFork0_~stop~1_144 v_thread2Thread1of1ForFork0_~stop~1_143) (= |v_thread2Thread1of1ForFork0_#t~mem10_116| |v_thread2Thread1of1ForFork0_#t~mem10_115|)))) (= v_~res1~0_178 (ite (< .cse7 .cse8) (- 1) 1)) (let ((.cse11 (= (mod v_thread2Thread1of1ForFork0_~stop~1_143 256) 0)) (.cse9 (= |v_thread2Thread1of1ForFork0_#res.base_65| 0)) (.cse10 (= |v_thread2Thread1of1ForFork0_#res.offset_65| 0))) (or (and (= v_~res2~0_246 v_~res2~0_244) .cse9 .cse10 (not .cse11)) (and (= v_~n2~0_184 (+ v_~n1~0_172 v_~res2~0_244)) .cse11 .cse9 .cse10))) (= |v_thread1Thread1of1ForFork1_#res.offset_113| 0) (= v_thread1Thread1of1ForFork1_~stop~0_163 1) (not (= .cse7 .cse8)) (= |v_thread1Thread1of1ForFork1_#res.base_113| 0) (< v_thread1Thread1of1ForFork1_~i~0_255 v_~n1~0_172)))) InVars {~n2~0=v_~n2~0_184, ~n1~0=v_~n1~0_172, ~get2~0.base=v_~get2~0.base_224, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_255, ~get1~0.base=v_~get1~0.base_185, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_141, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_140|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_128|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_146|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_144, ~get2~0.offset=v_~get2~0.offset_224, #memory_int=|v_#memory_int_397|, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_116|, ~get1~0.offset=v_~get1~0.offset_185, ~res2~0=v_~res2~0_245} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_65|, ~res1~0=v_~res1~0_178, ~n1~0=v_~n1~0_172, ~get2~0.base=v_~get2~0.base_224, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_255, ~get1~0.base=v_~get1~0.base_185, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_134|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_118|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_65|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_221|, ~get2~0.offset=v_~get2~0.offset_224, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_115|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_163, thread2Thread1of1ForFork0_#t~mem10=|v_thread2Thread1of1ForFork0_#t~mem10_115|, ~res2~0=v_~res2~0_244, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_113|, ~n2~0=v_~n2~0_184, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_113|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_141, thread2Thread1of1ForFork0_#t~mem8=|v_thread2Thread1of1ForFork0_#t~mem8_139|, thread2Thread1of1ForFork0_#t~mem9=|v_thread2Thread1of1ForFork0_#t~mem9_127|, thread2Thread1of1ForFork0_#t~mem7=|v_thread2Thread1of1ForFork0_#t~mem7_145|, thread2Thread1of1ForFork0_~stop~1=v_thread2Thread1of1ForFork0_~stop~1_143, #memory_int=|v_#memory_int_397|, ~get1~0.offset=v_~get1~0.offset_185} AuxVars[v_~res2~0_246] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork0_#t~mem8, thread2Thread1of1ForFork0_#t~mem9, thread2Thread1of1ForFork0_#t~mem7, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread2Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork0_~stop~1, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_~stop~0, thread2Thread1of1ForFork0_#t~mem10, ~res2~0] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:14,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [840] L49-6-->thread1EXIT: Formula: (let ((.cse2 (* v_thread1Thread1of1ForFork1_~i~0_247 4))) (let ((.cse1 (select (select |v_#memory_int_387| v_~get1~0.base_177) (+ .cse2 v_~get1~0.offset_177))) (.cse0 (select (select |v_#memory_int_387| v_~get2~0.base_216) (+ v_~get2~0.offset_216 .cse2)))) (and (= |v_thread1Thread1of1ForFork1_#res.base_107| 0) (= v_thread1Thread1of1ForFork1_~stop~0_157 1) (< v_thread1Thread1of1ForFork1_~i~0_247 v_~n1~0_164) (not (= .cse0 .cse1)) (= |v_thread1Thread1of1ForFork1_#res.offset_107| 0) (< v_thread1Thread1of1ForFork1_~i~0_247 v_~n2~0_176) (= (ite (< .cse1 .cse0) (- 1) 1) v_~res1~0_172)))) InVars {~n2~0=v_~n2~0_176, ~n1~0=v_~n1~0_164, ~get2~0.offset=v_~get2~0.offset_216, #memory_int=|v_#memory_int_387|, ~get2~0.base=v_~get2~0.base_216, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_247, ~get1~0.offset=v_~get1~0.offset_177, ~get1~0.base=v_~get1~0.base_177} OutVars{~res1~0=v_~res1~0_172, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_107|, ~n2~0=v_~n2~0_176, ~n1~0=v_~n1~0_164, ~get2~0.base=v_~get2~0.base_216, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_247, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_107|, ~get1~0.base=v_~get1~0.base_177, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_126|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_110|, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_207|, thread1Thread1of1ForFork1_#t~mem5=|v_thread1Thread1of1ForFork1_#t~mem5_109|, ~get2~0.offset=v_~get2~0.offset_216, #memory_int=|v_#memory_int_387|, thread1Thread1of1ForFork1_~stop~0=v_thread1Thread1of1ForFork1_~stop~0_157, ~get1~0.offset=v_~get1~0.offset_177} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~mem5, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~stop~0] and [701] L97-4-->L98-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre19#1_37| |v_#pthreadsForks_22|) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre19#1_37|))) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_17|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 07:25:14,917 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:25:14,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:14,918 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:25:14,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:25:14,919 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:25:14,921 INFO L158 Benchmark]: Toolchain (without parser) took 36906.54ms. Allocated memory was 179.3MB in the beginning and 467.7MB in the end (delta: 288.4MB). Free memory was 154.7MB in the beginning and 411.8MB in the end (delta: -257.1MB). Peak memory consumption was 285.0MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,921 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 179.3MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:25:14,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.03ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 142.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 179.3MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,922 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,922 INFO L158 Benchmark]: RCFGBuilder took 544.06ms. Allocated memory is still 179.3MB. Free memory was 138.9MB in the beginning and 119.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,922 INFO L158 Benchmark]: TraceAbstraction took 36024.28ms. Allocated memory was 179.3MB in the beginning and 467.7MB in the end (delta: 288.4MB). Free memory was 119.0MB in the beginning and 411.8MB in the end (delta: -292.7MB). Peak memory consumption was 249.4MB. Max. memory is 8.0GB. [2022-12-06 07:25:14,923 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.21ms. Allocated memory is still 179.3MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.03ms. Allocated memory is still 179.3MB. Free memory was 154.1MB in the beginning and 142.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 179.3MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.06ms. Allocated memory is still 179.3MB. Free memory was 138.9MB in the beginning and 119.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 36024.28ms. Allocated memory was 179.3MB in the beginning and 467.7MB in the end (delta: 288.4MB). Free memory was 119.0MB in the beginning and 411.8MB in the end (delta: -292.7MB). Peak memory consumption was 249.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 183 PlacesBefore, 25 PlacesAfterwards, 197 TransitionsBefore, 25 TransitionsAfterwards, 2700 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 108 TrivialYvCompositions, 50 ConcurrentYvCompositions, 13 ChoiceCompositions, 172 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1534, independent: 1507, independent conditional: 1507, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1534, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1534, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1534, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1422, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1422, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1534, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1422, unknown conditional: 0, unknown unconditional: 1422] , Statistics on independence cache: Total cache size (in pairs): 2494, Positive cache size: 2477, Positive conditional cache size: 0, Positive unconditional cache size: 2477, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 40 PlacesBefore, 37 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 136, independent conditional: 48, independent unconditional: 88, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 136, independent conditional: 28, independent unconditional: 108, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 136, independent conditional: 28, independent unconditional: 108, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 158, independent: 126, independent conditional: 26, independent unconditional: 100, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 38, Positive conditional cache size: 2, Positive unconditional cache size: 36, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 48 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 119, independent conditional: 35, independent unconditional: 84, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 119, independent conditional: 5, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 119, independent conditional: 5, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 147, independent: 115, independent conditional: 4, independent unconditional: 111, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 42, Positive conditional cache size: 3, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 54 PlacesBefore, 52 PlacesAfterwards, 52 TransitionsBefore, 50 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 237, independent: 199, independent conditional: 85, independent unconditional: 114, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 199, independent conditional: 18, independent unconditional: 181, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 199, independent conditional: 18, independent unconditional: 181, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 237, independent: 192, independent conditional: 11, independent unconditional: 181, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 49, Positive conditional cache size: 10, Positive unconditional cache size: 39, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 59 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 57 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, independent: 235, independent conditional: 235, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 278, independent: 235, independent conditional: 106, independent unconditional: 129, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 278, independent: 235, independent conditional: 17, independent unconditional: 218, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 278, independent: 235, independent conditional: 17, independent unconditional: 218, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 5, independent unconditional: 2, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 278, independent: 228, independent conditional: 12, independent unconditional: 216, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 62, Positive conditional cache size: 15, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 16, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 64, independent conditional: 2, independent unconditional: 62, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 2, independent unconditional: 62, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 80, independent: 64, independent conditional: 2, independent unconditional: 62, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 62, Positive conditional cache size: 15, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 67 PlacesBefore, 64 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 122, independent conditional: 58, independent unconditional: 64, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 122, independent conditional: 12, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 122, independent conditional: 12, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 119, independent conditional: 9, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 65, Positive conditional cache size: 18, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 66 PlacesBefore, 66 PlacesAfterwards, 55 TransitionsBefore, 56 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 177, independent conditional: 57, independent unconditional: 120, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, independent: 177, independent conditional: 15, independent unconditional: 162, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 177, independent conditional: 15, independent unconditional: 162, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 217, independent: 170, independent conditional: 9, independent unconditional: 161, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 24, Positive unconditional cache size: 52, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 69 PlacesBefore, 70 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, independent: 224, independent conditional: 224, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 268, independent: 224, independent conditional: 48, independent unconditional: 176, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268, independent: 224, independent conditional: 7, independent unconditional: 217, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268, independent: 224, independent conditional: 7, independent unconditional: 217, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 268, independent: 223, independent conditional: 6, independent unconditional: 217, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 78, Positive conditional cache size: 25, Positive unconditional cache size: 53, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 70 PlacesBefore, 71 PlacesAfterwards, 45 TransitionsBefore, 47 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 144, independent conditional: 45, independent unconditional: 99, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 144, independent conditional: 10, independent unconditional: 134, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 144, independent conditional: 10, independent unconditional: 134, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 177, independent: 138, independent conditional: 7, independent unconditional: 131, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 85, Positive conditional cache size: 28, Positive unconditional cache size: 57, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 63 PlacesBefore, 64 PlacesAfterwards, 42 TransitionsBefore, 44 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 105, independent conditional: 43, independent unconditional: 62, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 105, independent conditional: 10, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 105, independent conditional: 10, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, independent: 102, independent conditional: 7, independent unconditional: 95, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 89, Positive conditional cache size: 31, Positive unconditional cache size: 58, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 16, independent unconditional: 30, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 46, independent conditional: 4, independent unconditional: 42, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 89, Positive conditional cache size: 31, Positive unconditional cache size: 58, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 13, dependent conditional: 2, dependent unconditional: 11, 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: 26, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 89, Positive conditional cache size: 31, Positive unconditional cache size: 58, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 11, dependent conditional: 2, dependent unconditional: 9, 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: 33, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 89, Positive conditional cache size: 31, Positive unconditional cache size: 58, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 28, independent unconditional: 8, 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: 36, independent: 36, independent conditional: 26, independent unconditional: 10, 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: 36, independent: 36, independent conditional: 26, independent unconditional: 10, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 33, independent conditional: 23, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 123, Positive conditional cache size: 34, Positive unconditional cache size: 89, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 12, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 142, Positive conditional cache size: 35, Positive unconditional cache size: 107, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 54 PlacesBefore, 54 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 145, Positive conditional cache size: 38, Positive unconditional cache size: 107, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 64 PlacesBefore, 63 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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): 158, Positive cache size: 150, Positive conditional cache size: 38, Positive unconditional cache size: 112, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 66 PlacesBefore, 65 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 292 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 153, Positive conditional cache size: 41, Positive unconditional cache size: 112, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:25:14,961 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...