/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/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:09:46,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:09:46,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:09:46,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:09:46,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:09:46,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:09:46,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:09:46,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:09:46,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:09:46,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:09:46,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:09:46,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:09:46,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:09:46,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:09:46,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:09:46,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:09:46,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:09:46,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:09:46,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:09:46,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:09:46,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:09:46,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:09:46,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:09:46,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:09:46,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:09:46,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:09:46,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:09:46,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:09:46,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:09:46,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:09:46,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:09:46,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:09:46,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:09:46,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:09:46,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:09:46,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:09:46,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:09:46,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:09:46,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:09:46,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:09:46,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:09:46,503 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:09:46,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:09:46,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:09:46,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:09:46,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:09:46,536 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:09:46,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:09:46,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:09:46,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:09:46,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:09:46,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:09:46,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:09:46,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:09:46,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:46,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:09:46,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:09:46,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:09:46,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:09:46,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:09:46,541 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:09:46,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:09:46,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:09:46,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:09:46,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:09:46,902 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:09:46,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-06 07:09:47,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:09:48,186 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:09:48,186 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-06 07:09:48,193 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968315077/35edb6b845e6445ba615c9045044a4ed/FLAGb80972045 [2022-12-06 07:09:48,212 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968315077/35edb6b845e6445ba615c9045044a4ed [2022-12-06 07:09:48,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:09:48,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:09:48,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:48,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:09:48,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:09:48,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bee0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48, skipping insertion in model container [2022-12-06 07:09:48,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:09:48,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:09:48,409 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/bench-exp2x9.wvr.c[2669,2682] [2022-12-06 07:09:48,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:48,428 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:09:48,448 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/bench-exp2x9.wvr.c[2669,2682] [2022-12-06 07:09:48,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:48,466 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:09:48,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48 WrapperNode [2022-12-06 07:09:48,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:48,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:48,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:09:48,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:09:48,475 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:09:48" (1/1) ... [2022-12-06 07:09:48,491 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:09:48" (1/1) ... [2022-12-06 07:09:48,516 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 07:09:48,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:48,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:09:48,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:09:48,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:09:48,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,549 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:09:48,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:09:48,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:09:48,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:09:48,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (1/1) ... [2022-12-06 07:09:48,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:48,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:48,588 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:09:48,609 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:09:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:09:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:09:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:09:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:09:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:09:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:09:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:09:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:09:48,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:09:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:09:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:09:48,631 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:09:48,734 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:09:48,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:09:49,049 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:09:49,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:09:49,056 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:09:49,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:49 BoogieIcfgContainer [2022-12-06 07:09:49,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:09:49,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:09:49,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:09:49,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:09:49,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:09:48" (1/3) ... [2022-12-06 07:09:49,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f4c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:49, skipping insertion in model container [2022-12-06 07:09:49,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:48" (2/3) ... [2022-12-06 07:09:49,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2f4c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:49, skipping insertion in model container [2022-12-06 07:09:49,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:49" (3/3) ... [2022-12-06 07:09:49,071 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2022-12-06 07:09:49,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:09:49,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:09:49,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:09:49,190 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:09:49,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 316 flow [2022-12-06 07:09:49,329 INFO L130 PetriNetUnfolder]: 10/138 cut-off events. [2022-12-06 07:09:49,330 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 138 events. 10/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:09:49,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 142 transitions, 316 flow [2022-12-06 07:09:49,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 126 transitions, 276 flow [2022-12-06 07:09:49,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:49,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-06 07:09:49,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 126 transitions, 276 flow [2022-12-06 07:09:49,399 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-06 07:09:49,399 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:49,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 10/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:09:49,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-06 07:09:49,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 3312 [2022-12-06 07:09:54,942 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 07:09:54,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:54,961 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;@1898c039, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:54,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:09:54,967 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:09:54,967 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:54,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:54,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:54,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1738926514, now seen corresponding path program 1 times [2022-12-06 07:09:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:54,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724948393] [2022-12-06 07:09:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:55,612 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:09:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724948393] [2022-12-06 07:09:55,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724948393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:55,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:55,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:09:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634011321] [2022-12-06 07:09:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:55,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:55,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:55,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:09:55,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:55,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:55,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:55,838 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-06 07:09:55,838 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 07:09:55,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1759 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 07:09:55,844 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-06 07:09:55,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 07:09:55,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:55,856 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-06 07:09:55,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:55,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 07:09:55,863 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-06 07:09:55,868 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 07:09:55,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:55,868 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:55,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:55,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,886 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0][19], [17#L80-1true, 26#L109-4true, 29#L52-1true, Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 148#true, 19#L38-1true, 117#L66-1true]) [2022-12-06 07:09:55,886 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:55,886 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:55,886 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:55,887 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:55,889 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-06 07:09:55,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 55 events. 19/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-06 07:09:55,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 07:09:55,891 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:55,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:09:55,893 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:55,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:09:55,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:55,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:55,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:55,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1759079634, now seen corresponding path program 1 times [2022-12-06 07:09:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:55,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556463761] [2022-12-06 07:09:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:56,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556463761] [2022-12-06 07:09:56,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556463761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:56,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:56,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757329488] [2022-12-06 07:09:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:56,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:56,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:56,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:56,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:56,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:56,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:56,327 INFO L130 PetriNetUnfolder]: 699/957 cut-off events. [2022-12-06 07:09:56,327 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-06 07:09:56,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 957 events. 699/957 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2889 event pairs, 35 based on Foata normal form. 26/983 useless extension candidates. Maximal degree in co-relation 838. Up to 461 conditions per place. [2022-12-06 07:09:56,339 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-06 07:09:56,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 82 transitions, 405 flow [2022-12-06 07:09:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:09:56,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-06 07:09:56,341 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:09:56,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 82 transitions, 405 flow [2022-12-06 07:09:56,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 82 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:56,344 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-06 07:09:56,345 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 07:09:56,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:56,345 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:56,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:56,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,351 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0][27], [17#L80-1true, 26#L109-4true, 29#L52-1true, Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 19#L38-1true, 117#L66-1true, 152#true, Black: 154#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 157#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 07:09:56,351 INFO L382 tUnfolder$Statistics]: this new event has 11 ancestors and is cut-off event [2022-12-06 07:09:56,351 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:56,351 INFO L385 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2022-12-06 07:09:56,351 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:56,355 INFO L130 PetriNetUnfolder]: 47/104 cut-off events. [2022-12-06 07:09:56,355 INFO L131 PetriNetUnfolder]: For 50/71 co-relation queries the response was YES. [2022-12-06 07:09:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 104 events. 47/104 cut-off events. For 50/71 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 228 event pairs, 0 based on Foata normal form. 6/95 useless extension candidates. Maximal degree in co-relation 180. Up to 52 conditions per place. [2022-12-06 07:09:56,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-06 07:09:56,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:56,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:09:56,359 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 151 flow [2022-12-06 07:09:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:56,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:56,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:56,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -151813910, now seen corresponding path program 2 times [2022-12-06 07:09:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765970707] [2022-12-06 07:09:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765970707] [2022-12-06 07:09:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765970707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:56,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:56,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757942313] [2022-12-06 07:09:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:56,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:56,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:56,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:56,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:56,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:56,707 INFO L130 PetriNetUnfolder]: 811/1105 cut-off events. [2022-12-06 07:09:56,708 INFO L131 PetriNetUnfolder]: For 909/909 co-relation queries the response was YES. [2022-12-06 07:09:56,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1105 events. 811/1105 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3354 event pairs, 233 based on Foata normal form. 36/1141 useless extension candidates. Maximal degree in co-relation 955. Up to 523 conditions per place. [2022-12-06 07:09:56,715 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-06 07:09:56,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 82 transitions, 456 flow [2022-12-06 07:09:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:09:56,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-06 07:09:56,717 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 151 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:09:56,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 82 transitions, 456 flow [2022-12-06 07:09:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 82 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:09:56,721 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 07:09:56,722 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 07:09:56,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:56,722 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:56,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:56,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,732 INFO L130 PetriNetUnfolder]: 55/116 cut-off events. [2022-12-06 07:09:56,732 INFO L131 PetriNetUnfolder]: For 147/165 co-relation queries the response was YES. [2022-12-06 07:09:56,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 116 events. 55/116 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 257 event pairs, 0 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 257. Up to 63 conditions per place. [2022-12-06 07:09:56,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 07:09:56,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:56,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:09:56,736 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 205 flow [2022-12-06 07:09:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:56,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:56,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:56,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:09:56,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 43416820, now seen corresponding path program 1 times [2022-12-06 07:09:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350150133] [2022-12-06 07:09:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:56,866 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:09:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350150133] [2022-12-06 07:09:56,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350150133] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149728399] [2022-12-06 07:09:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:56,870 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:09:56,909 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:09:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:57,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:57,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:57,418 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:09:57,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:57,470 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:09:57,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149728399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:57,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:57,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:09:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137452369] [2022-12-06 07:09:57,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:57,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:09:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:09:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:09:57,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:57,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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:09:57,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:57,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:57,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:57,886 INFO L130 PetriNetUnfolder]: 1503/2055 cut-off events. [2022-12-06 07:09:57,886 INFO L131 PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES. [2022-12-06 07:09:57,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 2055 events. 1503/2055 cut-off events. For 3695/3695 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7511 event pairs, 103 based on Foata normal form. 72/2127 useless extension candidates. Maximal degree in co-relation 3855. Up to 882 conditions per place. [2022-12-06 07:09:57,900 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 115 selfloop transitions, 11 changer transitions 1/127 dead transitions. [2022-12-06 07:09:57,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 127 transitions, 892 flow [2022-12-06 07:09:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:09:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:09:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 07:09:57,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:57,906 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 205 flow. Second operand 6 states and 96 transitions. [2022-12-06 07:09:57,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 127 transitions, 892 flow [2022-12-06 07:09:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 127 transitions, 863 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:57,918 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-06 07:09:57,919 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-06 07:09:57,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:57,920 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:57,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:57,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,938 INFO L130 PetriNetUnfolder]: 94/212 cut-off events. [2022-12-06 07:09:57,938 INFO L131 PetriNetUnfolder]: For 277/360 co-relation queries the response was YES. [2022-12-06 07:09:57,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 212 events. 94/212 cut-off events. For 277/360 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 742 event pairs, 6 based on Foata normal form. 7/191 useless extension candidates. Maximal degree in co-relation 534. Up to 107 conditions per place. [2022-12-06 07:09:57,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-06 07:09:57,946 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:57,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:09:57,948 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 255 flow [2022-12-06 07:09:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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:09:57,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:57,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:57,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:09:58,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:58,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -444036910, now seen corresponding path program 1 times [2022-12-06 07:09:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:58,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186814188] [2022-12-06 07:09:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186814188] [2022-12-06 07:09:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186814188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:58,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906245636] [2022-12-06 07:09:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:58,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:58,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:58,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:58,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:58,588 INFO L130 PetriNetUnfolder]: 1445/1997 cut-off events. [2022-12-06 07:09:58,589 INFO L131 PetriNetUnfolder]: For 5290/5290 co-relation queries the response was YES. [2022-12-06 07:09:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 1997 events. 1445/1997 cut-off events. For 5290/5290 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7476 event pairs, 119 based on Foata normal form. 58/2055 useless extension candidates. Maximal degree in co-relation 4487. Up to 831 conditions per place. [2022-12-06 07:09:58,604 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 91 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2022-12-06 07:09:58,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 683 flow [2022-12-06 07:09:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 07:09:58,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 07:09:58,605 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 255 flow. Second operand 5 states and 75 transitions. [2022-12-06 07:09:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 683 flow [2022-12-06 07:09:58,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:58,616 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-06 07:09:58,617 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-06 07:09:58,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:58,617 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:58,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:58,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,633 INFO L130 PetriNetUnfolder]: 87/197 cut-off events. [2022-12-06 07:09:58,634 INFO L131 PetriNetUnfolder]: For 299/365 co-relation queries the response was YES. [2022-12-06 07:09:58,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 197 events. 87/197 cut-off events. For 299/365 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 677 event pairs, 7 based on Foata normal form. 7/178 useless extension candidates. Maximal degree in co-relation 515. Up to 98 conditions per place. [2022-12-06 07:09:58,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 07:09:58,638 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:58,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:09:58,639 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 263 flow [2022-12-06 07:09:58,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:58,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:58,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:58,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:09:58,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash 236007172, now seen corresponding path program 2 times [2022-12-06 07:09:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:58,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078447901] [2022-12-06 07:09:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078447901] [2022-12-06 07:09:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078447901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:58,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:58,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460401234] [2022-12-06 07:09:58,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:58,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:58,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:58,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:58,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:58,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:58,979 INFO L130 PetriNetUnfolder]: 1275/1751 cut-off events. [2022-12-06 07:09:58,979 INFO L131 PetriNetUnfolder]: For 5366/5366 co-relation queries the response was YES. [2022-12-06 07:09:58,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1751 events. 1275/1751 cut-off events. For 5366/5366 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6131 event pairs, 65 based on Foata normal form. 34/1785 useless extension candidates. Maximal degree in co-relation 4225. Up to 710 conditions per place. [2022-12-06 07:09:58,991 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 102 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2022-12-06 07:09:58,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 919 flow [2022-12-06 07:09:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 07:09:58,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 07:09:58,993 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 263 flow. Second operand 5 states and 72 transitions. [2022-12-06 07:09:58,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 919 flow [2022-12-06 07:09:58,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 894 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:59,000 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-06 07:09:59,001 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-06 07:09:59,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:59,001 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:59,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:59,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,015 INFO L130 PetriNetUnfolder]: 74/155 cut-off events. [2022-12-06 07:09:59,015 INFO L131 PetriNetUnfolder]: For 259/340 co-relation queries the response was YES. [2022-12-06 07:09:59,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 155 events. 74/155 cut-off events. For 259/340 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 434 event pairs, 1 based on Foata normal form. 6/146 useless extension candidates. Maximal degree in co-relation 466. Up to 81 conditions per place. [2022-12-06 07:09:59,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 07:09:59,018 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:59,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:09:59,019 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 313 flow [2022-12-06 07:09:59,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:59,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:59,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:59,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:09:59,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 636522545, now seen corresponding path program 1 times [2022-12-06 07:09:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:59,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571627645] [2022-12-06 07:09:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:59,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571627645] [2022-12-06 07:09:59,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571627645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:59,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:59,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536986553] [2022-12-06 07:09:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:59,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:59,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:59,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:59,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:59,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:59,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:59,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:59,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:59,423 INFO L130 PetriNetUnfolder]: 1259/1735 cut-off events. [2022-12-06 07:09:59,424 INFO L131 PetriNetUnfolder]: For 5392/5392 co-relation queries the response was YES. [2022-12-06 07:09:59,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7856 conditions, 1735 events. 1259/1735 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5988 event pairs, 261 based on Foata normal form. 16/1751 useless extension candidates. Maximal degree in co-relation 5018. Up to 1529 conditions per place. [2022-12-06 07:09:59,436 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 62 selfloop transitions, 9 changer transitions 11/82 dead transitions. [2022-12-06 07:09:59,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 629 flow [2022-12-06 07:09:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 07:09:59,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 07:09:59,438 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 313 flow. Second operand 4 states and 61 transitions. [2022-12-06 07:09:59,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 629 flow [2022-12-06 07:09:59,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 617 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 07:09:59,447 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-06 07:09:59,448 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-06 07:09:59,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:59,448 INFO L89 Accepts]: Start accepts. Operand has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:59,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:59,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,464 INFO L130 PetriNetUnfolder]: 76/167 cut-off events. [2022-12-06 07:09:59,464 INFO L131 PetriNetUnfolder]: For 330/415 co-relation queries the response was YES. [2022-12-06 07:09:59,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 167 events. 76/167 cut-off events. For 330/415 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 526 event pairs, 2 based on Foata normal form. 5/152 useless extension candidates. Maximal degree in co-relation 518. Up to 81 conditions per place. [2022-12-06 07:09:59,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 07:09:59,469 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:59,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:09:59,470 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 364 flow [2022-12-06 07:09:59,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:09:59,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:59,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:59,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:09:59,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash 441524475, now seen corresponding path program 2 times [2022-12-06 07:09:59,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:59,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452979342] [2022-12-06 07:09:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:59,653 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:09:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:59,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452979342] [2022-12-06 07:09:59,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452979342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:59,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729035996] [2022-12-06 07:09:59,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:09:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:59,656 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:09:59,658 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:09:59,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:09:59,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:09:59,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:59,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:59,839 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:09:59,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:59,898 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:09:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729035996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:59,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:09:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130223978] [2022-12-06 07:09:59,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:59,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:09:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:09:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:09:59,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:59,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:09:59,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:59,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:10:00,283 INFO L130 PetriNetUnfolder]: 1555/2145 cut-off events. [2022-12-06 07:10:00,284 INFO L131 PetriNetUnfolder]: For 6492/6492 co-relation queries the response was YES. [2022-12-06 07:10:00,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9738 conditions, 2145 events. 1555/2145 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7790 event pairs, 187 based on Foata normal form. 68/2213 useless extension candidates. Maximal degree in co-relation 6135. Up to 1119 conditions per place. [2022-12-06 07:10:00,302 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 120 selfloop transitions, 13 changer transitions 3/136 dead transitions. [2022-12-06 07:10:00,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 1092 flow [2022-12-06 07:10:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:10:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:10:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 07:10:00,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:10:00,303 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 364 flow. Second operand 6 states and 96 transitions. [2022-12-06 07:10:00,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 1092 flow [2022-12-06 07:10:00,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 136 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:10:00,315 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 411 flow [2022-12-06 07:10:00,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-06 07:10:00,316 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-06 07:10:00,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:10:00,316 INFO L89 Accepts]: Start accepts. Operand has 64 places, 54 transitions, 411 flow [2022-12-06 07:10:00,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:10:00,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:10:00,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 411 flow [2022-12-06 07:10:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 411 flow [2022-12-06 07:10:00,335 INFO L130 PetriNetUnfolder]: 113/230 cut-off events. [2022-12-06 07:10:00,335 INFO L131 PetriNetUnfolder]: For 608/716 co-relation queries the response was YES. [2022-12-06 07:10:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 230 events. 113/230 cut-off events. For 608/716 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 779 event pairs, 5 based on Foata normal form. 6/216 useless extension candidates. Maximal degree in co-relation 806. Up to 126 conditions per place. [2022-12-06 07:10:00,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 411 flow [2022-12-06 07:10:00,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 07:10:00,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L80-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_12 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_12} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_12, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:10:00,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:10:00,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:10:00,405 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 421 flow [2022-12-06 07:10:00,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:10:00,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:10:00,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:10:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:10:00,606 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,SelfDestructingSolverStorable7 [2022-12-06 07:10:00,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:10:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:10:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1119399486, now seen corresponding path program 2 times [2022-12-06 07:10:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:10:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774470105] [2022-12-06 07:10:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:10:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:10:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:10:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774470105] [2022-12-06 07:10:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774470105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:10:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:10:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:10:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335892488] [2022-12-06 07:10:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:10:00,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:10:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:10:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:10:00,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:10:00,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:10:00,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:10:00,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:10:00,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:10:00,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:10:01,039 INFO L130 PetriNetUnfolder]: 1795/2461 cut-off events. [2022-12-06 07:10:01,040 INFO L131 PetriNetUnfolder]: For 10192/10192 co-relation queries the response was YES. [2022-12-06 07:10:01,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12248 conditions, 2461 events. 1795/2461 cut-off events. For 10192/10192 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9038 event pairs, 419 based on Foata normal form. 76/2537 useless extension candidates. Maximal degree in co-relation 9423. Up to 2001 conditions per place. [2022-12-06 07:10:01,058 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 87 selfloop transitions, 8 changer transitions 3/98 dead transitions. [2022-12-06 07:10:01,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 889 flow [2022-12-06 07:10:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:10:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:10:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 07:10:01,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-06 07:10:01,060 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 421 flow. Second operand 4 states and 62 transitions. [2022-12-06 07:10:01,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 889 flow [2022-12-06 07:10:01,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 822 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 07:10:01,079 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 411 flow [2022-12-06 07:10:01,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-06 07:10:01,079 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 07:10:01,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:10:01,080 INFO L89 Accepts]: Start accepts. Operand has 65 places, 55 transitions, 411 flow [2022-12-06 07:10:01,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:10:01,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:10:01,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 55 transitions, 411 flow [2022-12-06 07:10:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 55 transitions, 411 flow [2022-12-06 07:10:01,101 INFO L130 PetriNetUnfolder]: 136/279 cut-off events. [2022-12-06 07:10:01,101 INFO L131 PetriNetUnfolder]: For 703/825 co-relation queries the response was YES. [2022-12-06 07:10:01,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 279 events. 136/279 cut-off events. For 703/825 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1044 event pairs, 11 based on Foata normal form. 7/259 useless extension candidates. Maximal degree in co-relation 1017. Up to 148 conditions per place. [2022-12-06 07:10:01,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 55 transitions, 411 flow [2022-12-06 07:10:01,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-06 07:10:01,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:10:01,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:10:01,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 07:10:01,141 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 416 flow [2022-12-06 07:10:01,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:10:01,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:10:01,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:10:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:10:01,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:10:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:10:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 498782777, now seen corresponding path program 1 times [2022-12-06 07:10:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:10:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500968559] [2022-12-06 07:10:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:10:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:01,630 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:10:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:10:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500968559] [2022-12-06 07:10:01,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500968559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:10:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61691467] [2022-12-06 07:10:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:01,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:10:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:10:01,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:10:01,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:10:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:10:47,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:11:02,626 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:11:02,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:11:14,266 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:11:14,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61691467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:11:14,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:11:14,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:11:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977959792] [2022-12-06 07:11:14,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:11:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:11:14,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:11:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:11:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=106, Unknown=11, NotChecked=0, Total=156 [2022-12-06 07:11:14,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:11:14,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 416 flow. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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:11:14,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:11:14,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:11:14,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:11:16,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:39,957 WARN L233 SmtUtils]: Spent 21.95s on a formula simplification. DAG size of input: 78 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:11:42,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:44,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:46,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:48,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:58,658 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 54 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:12:00,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:07,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:09,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:11,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:13,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:26,825 WARN L233 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:12:28,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:30,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:37,447 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 49 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:12:38,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:47,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:50,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:52,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:54,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:56,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:58,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:00,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:02,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:14,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:16,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:18,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:20,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:22,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:24,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:26,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:28,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:30,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:32,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:34,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:38,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:40,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:42,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:45,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:47,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:53,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:55,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:57,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:00,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:02,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:05,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:08,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:12,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:14,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:19,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:29,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:31,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:33,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:35,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:38,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:40,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:41,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:44,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:46,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:47,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:51,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:54,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:55,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:57,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:59,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:01,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:04,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:06,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:08,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:10,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:12,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:14,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:16,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:18,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:20,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:23,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:26,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:28,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:31,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:33,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:35,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:37,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:39,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:41,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:43,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:46,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:49,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:51,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:53,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:55,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:58,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:59,972 INFO L130 PetriNetUnfolder]: 3488/4889 cut-off events. [2022-12-06 07:15:59,972 INFO L131 PetriNetUnfolder]: For 17401/17401 co-relation queries the response was YES. [2022-12-06 07:15:59,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23009 conditions, 4889 events. 3488/4889 cut-off events. For 17401/17401 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 21411 event pairs, 450 based on Foata normal form. 4/4893 useless extension candidates. Maximal degree in co-relation 17002. Up to 2666 conditions per place. [2022-12-06 07:16:00,004 INFO L137 encePairwiseOnDemand]: 8/27 looper letters, 211 selfloop transitions, 113 changer transitions 11/335 dead transitions. [2022-12-06 07:16:00,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 335 transitions, 2726 flow [2022-12-06 07:16:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:16:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:16:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 249 transitions. [2022-12-06 07:16:00,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5424836601307189 [2022-12-06 07:16:00,007 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 416 flow. Second operand 17 states and 249 transitions. [2022-12-06 07:16:00,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 335 transitions, 2726 flow [2022-12-06 07:16:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 335 transitions, 2706 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:16:00,042 INFO L231 Difference]: Finished difference. Result has 86 places, 163 transitions, 1650 flow [2022-12-06 07:16:00,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1650, PETRI_PLACES=86, PETRI_TRANSITIONS=163} [2022-12-06 07:16:00,043 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2022-12-06 07:16:00,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:16:00,043 INFO L89 Accepts]: Start accepts. Operand has 86 places, 163 transitions, 1650 flow [2022-12-06 07:16:00,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:16:00,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:16:00,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 163 transitions, 1650 flow [2022-12-06 07:16:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 163 transitions, 1650 flow [2022-12-06 07:16:00,185 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([376] thread3EXIT-->L112-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][158], [Black: 322#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 378#(and (< 0 (mod ~x3~0 4294967296)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 459#(and (< ~x3~0 (+ (mod ~x4~0 4294967296) (* (div ~x3~0 4294967296) 4294967296) 1)) (< 0 (mod ~x3~0 4294967296)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), 155#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))), Black: 466#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 168#true, 468#true, Black: 154#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 157#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 316#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 165#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 163#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 325#true, Black: 200#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 302#(and (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), 74#thread4EXITtrue, Black: 614#(and (or (and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (or (and (< (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0 1)) (<= (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0) (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (* (mod ~x3~0 33554432) 128) (mod ~n~0 4294967296)))), Black: 610#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div ~x3~0 128) 4294967296)) (= (mod (* ~x4~0 127) 128) 0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (mod ~x3~0 128) 0) (< 0 (mod ~x1~0 4294967296))), Black: 627#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), Black: 470#(and (<= (+ (* (div ~x3~0 4294967296) 4294967296) 1) ~x3~0) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 160#true, 309#(<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296))), Black: 306#true, Black: 622#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (= (mod (* ~x4~0 127) 128) 0) (= (mod ~x3~0 128) 0) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), Black: 473#(and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 618#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), 129#L112-2true, Black: 315#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))]) [2022-12-06 07:16:00,185 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 07:16:00,185 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:16:00,185 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:16:00,185 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:16:00,195 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] thread4EXIT-->L113-2: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar1_4) (= 0 v_thread4Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem17#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread4Thread1of1ForFork2_thidvar0_4) (= 0 v_thread4Thread1of1ForFork2_thidvar3_4) (= 0 v_thread4Thread1of1ForFork2_thidvar4_4)) InVars {thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_5|, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4} OutVars{thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_4, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_4, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_5|, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_4, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[][161], [Black: 322#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 157#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 624#(and (or (< (* (mod ~x3~0 33554432) 128) (+ (mod ~x4~0 4294967296) 1)) (and (< (+ (* ~x3~0 128) (* 4294967296 (div (* ~x4~0 128) 4294967296))) (+ (* ~x4~0 128) (* (div (* ~x3~0 128) 4294967296) 4294967296) 1)) (<= (+ (* ~x4~0 128) (* (div (* ~x3~0 128) 4294967296) 4294967296)) (+ (* ~x3~0 128) (* 4294967296 (div (* ~x4~0 128) 4294967296)))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))) (or (and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (or (and (< (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0 1)) (<= (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0) (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (* (mod ~x3~0 33554432) 128) (mod ~n~0 4294967296)))), Black: 378#(and (< 0 (mod ~x3~0 4294967296)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 459#(and (< ~x3~0 (+ (mod ~x4~0 4294967296) (* (div ~x3~0 4294967296) 4294967296) 1)) (< 0 (mod ~x3~0 4294967296)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 466#(<= (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)), Black: 150#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 168#true, Black: 154#(<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 165#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)))), 316#(<= (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296))), Black: 163#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), 43#L113-2true, 325#true, 311#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), Black: 200#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 302#(and (< ~x4~0 (+ (mod ~x3~0 4294967296) (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 614#(and (or (and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (or (and (< (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0 1)) (<= (+ (* (div (* ~x3~0 128) 4294967296) 4294967296) ~x4~0) (+ (* ~x3~0 128) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (* (mod ~x3~0 33554432) 128) (mod ~n~0 4294967296)))), Black: 610#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div ~x3~0 128) 4294967296)) (= (mod (* ~x4~0 127) 128) 0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (mod ~x3~0 128) 0) (< 0 (mod ~x1~0 4294967296))), Black: 627#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), Black: 470#(and (<= (+ (* (div ~x3~0 4294967296) 4294967296) 1) ~x3~0) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), Black: 622#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (= (mod (* ~x4~0 127) 128) 0) (= (mod ~x3~0 128) 0) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), Black: 306#true, Black: 473#(and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 618#(and (= (mod (div ~x3~0 128) 4294967296) (mod (div (- ~x4~0) (- 128)) 4294967296)) (< (mod (div (- ~x4~0) (- 128)) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (<= (+ (mod (div (- ~x4~0) (- 128)) 4294967296) 1) (mod ~x3~0 4294967296))), Black: 315#(<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))]) [2022-12-06 07:16:00,195 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-12-06 07:16:00,195 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:16:00,195 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:16:00,198 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 07:16:00,200 INFO L130 PetriNetUnfolder]: 843/1518 cut-off events. [2022-12-06 07:16:00,200 INFO L131 PetriNetUnfolder]: For 13385/17069 co-relation queries the response was YES. [2022-12-06 07:16:00,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8467 conditions, 1518 events. 843/1518 cut-off events. For 13385/17069 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9220 event pairs, 251 based on Foata normal form. 49/1369 useless extension candidates. Maximal degree in co-relation 7648. Up to 780 conditions per place. [2022-12-06 07:16:00,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 163 transitions, 1650 flow [2022-12-06 07:16:00,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 1408 [2022-12-06 07:16:00,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] L52-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_85 4294967296))) (and (= v_~x1~0_117 (* v_~x1~0_118 128)) (= v_~x2~0_119 (* v_~x2~0_120 128)) (< (mod v_~x1~0_118 4294967296) .cse0) (< (mod v_~x2~0_120 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_120, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_118} OutVars{~x2~0=v_~x2~0_119, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_117} AuxVars[] AssignedVars[~x2~0, ~x1~0] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:16:00,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:16:00,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [446] L109-4-->L110-1: Formula: (= (select (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_25|) |v_ULTIMATE.start_main_#t~mem14#1_22|) InVars {#memory_int=|v_#memory_int_33|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_22|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:16:00,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:16:00,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:16:00,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:16:00,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [495] L80-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_12 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_12} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_12, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] [2022-12-06 07:16:00,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [458] L110-2-->L111-1: Formula: (= (select (select |v_#memory_int_37| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem15#1_24|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_24|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-06 07:16:00,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 07:16:00,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:16:00,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 07:16:00,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [451] L111-2-->L112-1: Formula: (= (select (select |v_#memory_int_35| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem16#1_22|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 07:16:00,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L66-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_12 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_12, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_12, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:16:00,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [446] L109-4-->L110-1: Formula: (= (select (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#t1~0#1.base_25|) |v_ULTIMATE.start_main_~#t1~0#1.offset_25|) |v_ULTIMATE.start_main_#t~mem14#1_22|) InVars {#memory_int=|v_#memory_int_33|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_22|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:16:00,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:16:01,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [496] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_14 4294967296) (mod v_~n~0_In_7 4294967296))) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:16:01,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:16:01,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:16:01,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [458] L110-2-->L111-1: Formula: (= (select (select |v_#memory_int_37| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem15#1_24|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_24|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-06 07:16:01,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 07:16:01,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-06 07:16:01,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (not (< (mod v_~x4~0_116 4294967296) .cse0)) (= (* 128 v_~x3~0_121) v_~x3~0_120) (< (mod v_~x3~0_121 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_15| 0) (= |v_thread4Thread1of1ForFork2_#res.base_15| 0))) InVars {~x3~0=v_~x3~0_121, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83} OutVars{~x3~0=v_~x3~0_120, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_15|, ~x4~0=v_~x4~0_116, ~n~0=v_~n~0_83, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [451] L111-2-->L112-1: Formula: (= (select (select |v_#memory_int_35| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem16#1_22|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_33|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 07:16:01,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:16:01,793 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:16:01,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1751 [2022-12-06 07:16:01,794 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 163 transitions, 1886 flow [2022-12-06 07:16:01,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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:16:01,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:16:01,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:16:01,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:16:01,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:16:01,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:16:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:16:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 659234307, now seen corresponding path program 1 times [2022-12-06 07:16:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:16:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356876898] [2022-12-06 07:16:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:16:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:16:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:16:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:16:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:16:02,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356876898] [2022-12-06 07:16:02,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356876898] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:16:02,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854492124] [2022-12-06 07:16:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:16:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:16:02,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:16:02,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:16:02,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:17:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:17:43,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:17:43,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:17:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:17:46,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:17:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:17:47,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854492124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:17:47,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:17:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-06 07:17:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115999697] [2022-12-06 07:17:47,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:17:47,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:17:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:17:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:17:47,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:17:47,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:17:47,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 163 transitions, 1886 flow. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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:17:47,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:17:47,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:17:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:17:57,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:17:59,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:01,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:03,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:05,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:07,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:09,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:12,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:14,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:17,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:21,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:23,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:26,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:30,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:32,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:35,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:18:35,811 INFO L130 PetriNetUnfolder]: 4042/5673 cut-off events. [2022-12-06 07:18:35,811 INFO L131 PetriNetUnfolder]: For 38941/38941 co-relation queries the response was YES. [2022-12-06 07:18:35,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35727 conditions, 5673 events. 4042/5673 cut-off events. For 38941/38941 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 25862 event pairs, 616 based on Foata normal form. 2/5647 useless extension candidates. Maximal degree in co-relation 34206. Up to 4684 conditions per place. [2022-12-06 07:18:35,849 INFO L137 encePairwiseOnDemand]: 44/53 looper letters, 248 selfloop transitions, 30 changer transitions 6/284 dead transitions. [2022-12-06 07:18:35,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 284 transitions, 3519 flow [2022-12-06 07:18:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:18:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:18:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2022-12-06 07:18:35,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35639412997903563 [2022-12-06 07:18:35,852 INFO L175 Difference]: Start difference. First operand has 86 places, 163 transitions, 1886 flow. Second operand 9 states and 170 transitions. [2022-12-06 07:18:35,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 284 transitions, 3519 flow [2022-12-06 07:18:35,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 284 transitions, 3329 flow, removed 91 selfloop flow, removed 1 redundant places. [2022-12-06 07:18:35,934 INFO L231 Difference]: Finished difference. Result has 97 places, 183 transitions, 1998 flow [2022-12-06 07:18:35,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1998, PETRI_PLACES=97, PETRI_TRANSITIONS=183} [2022-12-06 07:18:35,934 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 63 predicate places. [2022-12-06 07:18:35,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:18:35,935 INFO L89 Accepts]: Start accepts. Operand has 97 places, 183 transitions, 1998 flow [2022-12-06 07:18:35,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:18:35,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:18:35,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 183 transitions, 1998 flow [2022-12-06 07:18:35,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 183 transitions, 1998 flow [2022-12-06 07:18:36,086 INFO L130 PetriNetUnfolder]: 987/1764 cut-off events. [2022-12-06 07:18:36,086 INFO L131 PetriNetUnfolder]: For 19186/26903 co-relation queries the response was YES. [2022-12-06 07:18:36,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 1764 events. 987/1764 cut-off events. For 19186/26903 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 11302 event pairs, 389 based on Foata normal form. 50/1518 useless extension candidates. Maximal degree in co-relation 9546. Up to 1008 conditions per place. [2022-12-06 07:18:36,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 183 transitions, 1998 flow [2022-12-06 07:18:36,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1654 [2022-12-06 07:18:36,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:18:36,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:18:36,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:18:36,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L66-1-->thread3EXIT: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread3Thread1of1ForFork0_#res.offset_45| 0) (not (< (mod v_~x3~0_208 4294967296) .cse0)) (< (mod v_~x3~0_209 4294967296) .cse0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_45|) (= (* 128 v_~x3~0_209) v_~x3~0_208))) InVars {~x3~0=v_~x3~0_209, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_208, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_45|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_45|, ~n~0=v_~n~0_139} AuxVars[] AssignedVars[~x3~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:18:36,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L66-1-->thread3EXIT: Formula: (let ((.cse0 (mod v_~n~0_139 4294967296))) (and (= |v_thread3Thread1of1ForFork0_#res.offset_45| 0) (not (< (mod v_~x3~0_208 4294967296) .cse0)) (< (mod v_~x3~0_209 4294967296) .cse0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_45|) (= (* 128 v_~x3~0_209) v_~x3~0_208))) InVars {~x3~0=v_~x3~0_209, ~n~0=v_~n~0_139} OutVars{~x3~0=v_~x3~0_208, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_45|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_45|, ~n~0=v_~n~0_139} AuxVars[] AssignedVars[~x3~0, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:18:36,730 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:18:36,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 795 [2022-12-06 07:18:36,731 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 182 transitions, 2054 flow [2022-12-06 07:18:36,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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:18:36,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:18:36,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:18:36,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:18:36,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:18:36,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:18:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:18:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1214511552, now seen corresponding path program 1 times [2022-12-06 07:18:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:18:36,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230945451] [2022-12-06 07:18:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:18:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:18:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:18:37,133 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:18:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:18:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230945451] [2022-12-06 07:18:37,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230945451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:18:37,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19920775] [2022-12-06 07:18:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:18:37,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:18:37,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:18:37,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:18:37,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:18:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:18:38,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:18:38,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:18:38,569 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:18:38,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:19:10,518 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:19:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19920775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:19:10,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:19:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 8 [2022-12-06 07:19:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171033784] [2022-12-06 07:19:10,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:19:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:19:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:19:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:19:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:19:10,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 07:19:10,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 182 transitions, 2054 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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:19:10,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:19:10,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 07:19:10,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:19:12,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:14,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:15,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:18,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:21,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:23,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:26,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:28,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:30,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:32,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:34,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:36,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:38,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:40,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:43,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:45,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:47,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:49,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:51,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:53,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:56,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:19:58,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:00,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:02,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:04,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:06,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:08,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:10,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:14,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:16,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:19,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:20,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:22,148 INFO L130 PetriNetUnfolder]: 4566/6371 cut-off events. [2022-12-06 07:20:22,148 INFO L131 PetriNetUnfolder]: For 42546/42546 co-relation queries the response was YES. [2022-12-06 07:20:22,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39493 conditions, 6371 events. 4566/6371 cut-off events. For 42546/42546 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29582 event pairs, 433 based on Foata normal form. 14/6371 useless extension candidates. Maximal degree in co-relation 38443. Up to 3688 conditions per place. [2022-12-06 07:20:22,210 INFO L137 encePairwiseOnDemand]: 30/60 looper letters, 257 selfloop transitions, 49 changer transitions 7/313 dead transitions. [2022-12-06 07:20:22,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 313 transitions, 3863 flow [2022-12-06 07:20:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:20:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:20:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-06 07:20:22,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3547619047619048 [2022-12-06 07:20:22,212 INFO L175 Difference]: Start difference. First operand has 96 places, 182 transitions, 2054 flow. Second operand 7 states and 149 transitions. [2022-12-06 07:20:22,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 313 transitions, 3863 flow [2022-12-06 07:20:22,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 313 transitions, 3770 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-06 07:20:22,318 INFO L231 Difference]: Finished difference. Result has 101 places, 186 transitions, 2128 flow [2022-12-06 07:20:22,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2128, PETRI_PLACES=101, PETRI_TRANSITIONS=186} [2022-12-06 07:20:22,320 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2022-12-06 07:20:22,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:20:22,320 INFO L89 Accepts]: Start accepts. Operand has 101 places, 186 transitions, 2128 flow [2022-12-06 07:20:22,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:20:22,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:20:22,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 186 transitions, 2128 flow [2022-12-06 07:20:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 186 transitions, 2128 flow [2022-12-06 07:20:22,468 INFO L130 PetriNetUnfolder]: 993/1770 cut-off events. [2022-12-06 07:20:22,469 INFO L131 PetriNetUnfolder]: For 19610/28496 co-relation queries the response was YES. [2022-12-06 07:20:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 1770 events. 993/1770 cut-off events. For 19610/28496 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 11158 event pairs, 329 based on Foata normal form. 61/1533 useless extension candidates. Maximal degree in co-relation 9626. Up to 954 conditions per place. [2022-12-06 07:20:22,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 186 transitions, 2128 flow [2022-12-06 07:20:22,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 1780 [2022-12-06 07:20:22,521 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:20:22,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 07:20:22,522 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 186 transitions, 2137 flow [2022-12-06 07:20:22,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 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:20:22,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:20:22,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:20:22,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:20:22,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 07:20:22,729 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:20:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:20:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1289359160, now seen corresponding path program 1 times [2022-12-06 07:20:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:20:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760629663] [2022-12-06 07:20:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:20:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:20:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760629663] [2022-12-06 07:20:23,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760629663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:20:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652606514] [2022-12-06 07:20:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:20:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:20:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:20:23,016 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20:23,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:20:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:20:26,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:20:26,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:20:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:26,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:20:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:20:27,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652606514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:20:27,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:20:27,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 07:20:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802408106] [2022-12-06 07:20:27,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:20:27,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:20:27,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:20:27,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:20:27,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:20:27,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:20:27,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 186 transitions, 2137 flow. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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:20:27,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:20:27,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:20:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:20:30,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:33,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:35,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:37,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:40,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:42,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:44,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:46,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:48,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:50,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:52,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:54,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:56,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:20:58,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:01,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:03,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:06,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:08,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:10,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:12,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:14,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:16,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:18,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:20,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:23,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:26,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:28,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:30,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:32,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:34,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:36,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:38,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:40,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:45,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:48,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:51,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:53,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:55,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:57,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:21:59,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:00,509 INFO L130 PetriNetUnfolder]: 5368/7561 cut-off events. [2022-12-06 07:22:00,509 INFO L131 PetriNetUnfolder]: For 60236/60236 co-relation queries the response was YES. [2022-12-06 07:22:00,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48648 conditions, 7561 events. 5368/7561 cut-off events. For 60236/60236 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 37160 event pairs, 416 based on Foata normal form. 214/7761 useless extension candidates. Maximal degree in co-relation 47689. Up to 2665 conditions per place. [2022-12-06 07:22:00,558 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 337 selfloop transitions, 74 changer transitions 61/472 dead transitions. [2022-12-06 07:22:00,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 472 transitions, 6032 flow [2022-12-06 07:22:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:22:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:22:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2022-12-06 07:22:00,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2985658409387223 [2022-12-06 07:22:00,561 INFO L175 Difference]: Start difference. First operand has 101 places, 186 transitions, 2137 flow. Second operand 13 states and 229 transitions. [2022-12-06 07:22:00,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 472 transitions, 6032 flow [2022-12-06 07:22:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 472 transitions, 5881 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-06 07:22:00,660 INFO L231 Difference]: Finished difference. Result has 116 places, 186 transitions, 2317 flow [2022-12-06 07:22:00,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2317, PETRI_PLACES=116, PETRI_TRANSITIONS=186} [2022-12-06 07:22:00,661 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2022-12-06 07:22:00,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:00,661 INFO L89 Accepts]: Start accepts. Operand has 116 places, 186 transitions, 2317 flow [2022-12-06 07:22:00,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:00,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:00,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 186 transitions, 2317 flow [2022-12-06 07:22:00,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 186 transitions, 2317 flow [2022-12-06 07:22:00,840 INFO L130 PetriNetUnfolder]: 1134/2114 cut-off events. [2022-12-06 07:22:00,840 INFO L131 PetriNetUnfolder]: For 25012/32458 co-relation queries the response was YES. [2022-12-06 07:22:00,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 2114 events. 1134/2114 cut-off events. For 25012/32458 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 14876 event pairs, 475 based on Foata normal form. 72/1808 useless extension candidates. Maximal degree in co-relation 13056. Up to 1237 conditions per place. [2022-12-06 07:22:00,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 186 transitions, 2317 flow [2022-12-06 07:22:00,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 1898 [2022-12-06 07:22:01,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [488] L66-1-->L66-1: Formula: (and (< (mod v_~x3~0_113 4294967296) (mod v_~n~0_79 4294967296)) (= (* 128 v_~x3~0_113) v_~x3~0_111)) InVars {~x3~0=v_~x3~0_113, ~n~0=v_~n~0_79} OutVars{~x3~0=v_~x3~0_111, ~n~0=v_~n~0_79} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:22:01,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [524] L66-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_137 4294967296))) (and (< (* (mod v_~x3~0_202 33554432) 128) .cse0) (= (* 16384 v_~x3~0_202) v_~x3~0_200) (< (mod v_~x3~0_202 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_202, ~n~0=v_~n~0_137} OutVars{~x3~0=v_~x3~0_200, ~n~0=v_~n~0_137} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:22:01,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [532] L66-1-->thread4EXIT: Formula: (let ((.cse0 (mod v_~n~0_153 4294967296))) (and (= |v_thread3Thread1of1ForFork0_#res.offset_51| 0) (= (* 128 v_~x3~0_239) v_~x3~0_238) (not (< (mod v_~x4~0_162 4294967296) .cse0)) (not (< (mod v_~x3~0_238 4294967296) .cse0)) (= 0 |v_thread3Thread1of1ForFork0_#res.base_51|) (< (mod v_~x3~0_239 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_45| 0) (= |v_thread4Thread1of1ForFork2_#res.base_45| 0))) InVars {~x3~0=v_~x3~0_239, ~x4~0=v_~x4~0_162, ~n~0=v_~n~0_153} OutVars{~x3~0=v_~x3~0_238, thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_45|, ~x4~0=v_~x4~0_162, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_51|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_51|, ~n~0=v_~n~0_153, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_45|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork2_#res.base] [2022-12-06 07:22:02,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:02,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [523] L66-1-->L80-1: Formula: (let ((.cse0 (mod v_~n~0_135 4294967296))) (and (< (mod v_~x4~0_153 4294967296) .cse0) (< (mod v_~x3~0_197 4294967296) .cse0) (= (* 128 v_~x3~0_197) v_~x3~0_196) (= v_~x4~0_152 (* v_~x4~0_153 128)))) InVars {~x3~0=v_~x3~0_197, ~x4~0=v_~x4~0_153, ~n~0=v_~n~0_135} OutVars{~x3~0=v_~x3~0_196, ~x4~0=v_~x4~0_152, ~n~0=v_~n~0_135} AuxVars[] AssignedVars[~x3~0, ~x4~0] [2022-12-06 07:22:02,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L80-1-->L80-1: Formula: (and (= (* v_~x4~0_91 128) v_~x4~0_89) (< (mod v_~x4~0_91 4294967296) (mod v_~n~0_55 4294967296))) InVars {~x4~0=v_~x4~0_91, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_89, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:22:03,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_163 4294967296))) (and (< (mod v_~x3~0_260 4294967296) .cse0) (< (mod v_~x4~0_187 4294967296) .cse0) (= v_~x3~0_259 (* 128 v_~x3~0_260)) (= v_~x4~0_186 (* v_~x4~0_187 128)))) InVars {~x3~0=v_~x3~0_260, ~x4~0=v_~x4~0_187, ~n~0=v_~n~0_163} OutVars{~x3~0=v_~x3~0_259, ~x4~0=v_~x4~0_186, ~n~0=v_~n~0_163} AuxVars[] AssignedVars[~x3~0, ~x4~0] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:03,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L80-1-->L66-1: Formula: (let ((.cse0 (mod v_~n~0_163 4294967296))) (and (< (mod v_~x3~0_260 4294967296) .cse0) (< (mod v_~x4~0_187 4294967296) .cse0) (= v_~x3~0_259 (* 128 v_~x3~0_260)) (= v_~x4~0_186 (* v_~x4~0_187 128)))) InVars {~x3~0=v_~x3~0_260, ~x4~0=v_~x4~0_187, ~n~0=v_~n~0_163} OutVars{~x3~0=v_~x3~0_259, ~x4~0=v_~x4~0_186, ~n~0=v_~n~0_163} AuxVars[] AssignedVars[~x3~0, ~x4~0] and [484] L52-1-->L52-1: Formula: (and (< (mod v_~x2~0_106 4294967296) (mod v_~n~0_69 4294967296)) (= (* v_~x2~0_106 128) v_~x2~0_105)) InVars {~x2~0=v_~x2~0_106, ~n~0=v_~n~0_69} OutVars{~x2~0=v_~x2~0_105, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:22:03,487 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:22:03,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2827 [2022-12-06 07:22:03,488 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 186 transitions, 2539 flow [2022-12-06 07:22:03,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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:22:03,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:03,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:03,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:22:03,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:22:03,691 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:22:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -804130172, now seen corresponding path program 1 times [2022-12-06 07:22:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:03,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453816943] [2022-12-06 07:22:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453816943] [2022-12-06 07:22:03,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453816943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:03,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:03,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:22:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665192867] [2022-12-06 07:22:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:03,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:22:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:22:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:22:03,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:22:03,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 186 transitions, 2539 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:22:03,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:03,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:22:03,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:07,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:09,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:11,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:15,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:19,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:20,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:21,594 INFO L130 PetriNetUnfolder]: 5106/7177 cut-off events. [2022-12-06 07:22:21,595 INFO L131 PetriNetUnfolder]: For 72008/72008 co-relation queries the response was YES. [2022-12-06 07:22:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50896 conditions, 7177 events. 5106/7177 cut-off events. For 72008/72008 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35055 event pairs, 491 based on Foata normal form. 64/7213 useless extension candidates. Maximal degree in co-relation 49922. Up to 3732 conditions per place. [2022-12-06 07:22:21,668 INFO L137 encePairwiseOnDemand]: 19/61 looper letters, 196 selfloop transitions, 55 changer transitions 18/269 dead transitions. [2022-12-06 07:22:21,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 269 transitions, 3950 flow [2022-12-06 07:22:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:22:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:22:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 07:22:21,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3639344262295082 [2022-12-06 07:22:21,670 INFO L175 Difference]: Start difference. First operand has 114 places, 186 transitions, 2539 flow. Second operand 5 states and 111 transitions. [2022-12-06 07:22:21,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 269 transitions, 3950 flow [2022-12-06 07:22:21,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 269 transitions, 3698 flow, removed 93 selfloop flow, removed 5 redundant places. [2022-12-06 07:22:21,954 INFO L231 Difference]: Finished difference. Result has 116 places, 186 transitions, 2463 flow [2022-12-06 07:22:21,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2463, PETRI_PLACES=116, PETRI_TRANSITIONS=186} [2022-12-06 07:22:21,955 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2022-12-06 07:22:21,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:21,955 INFO L89 Accepts]: Start accepts. Operand has 116 places, 186 transitions, 2463 flow [2022-12-06 07:22:21,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:21,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:21,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 186 transitions, 2463 flow [2022-12-06 07:22:21,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 186 transitions, 2463 flow [2022-12-06 07:22:22,148 INFO L130 PetriNetUnfolder]: 1140/2144 cut-off events. [2022-12-06 07:22:22,148 INFO L131 PetriNetUnfolder]: For 25219/32781 co-relation queries the response was YES. [2022-12-06 07:22:22,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13770 conditions, 2144 events. 1140/2144 cut-off events. For 25219/32781 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 15083 event pairs, 500 based on Foata normal form. 76/1833 useless extension candidates. Maximal degree in co-relation 13397. Up to 1243 conditions per place. [2022-12-06 07:22:22,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 186 transitions, 2463 flow [2022-12-06 07:22:22,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 07:22:22,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:22,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 07:22:22,176 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 186 transitions, 2463 flow [2022-12-06 07:22:22,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:22:22,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:22,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:22,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:22:22,177 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:22:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash 136907600, now seen corresponding path program 1 times [2022-12-06 07:22:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:22,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817503204] [2022-12-06 07:22:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:22,285 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:22:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817503204] [2022-12-06 07:22:22,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817503204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:22,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:22,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:22:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173667880] [2022-12-06 07:22:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:22,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:22:22,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:22:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:22:22,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:22:22,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 186 transitions, 2463 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:22:22,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:22,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:22:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:23,416 INFO L130 PetriNetUnfolder]: 5184/7247 cut-off events. [2022-12-06 07:22:23,416 INFO L131 PetriNetUnfolder]: For 79935/79935 co-relation queries the response was YES. [2022-12-06 07:22:23,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51550 conditions, 7247 events. 5184/7247 cut-off events. For 79935/79935 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 34927 event pairs, 1553 based on Foata normal form. 166/7399 useless extension candidates. Maximal degree in co-relation 50554. Up to 3766 conditions per place. [2022-12-06 07:22:23,484 INFO L137 encePairwiseOnDemand]: 35/56 looper letters, 278 selfloop transitions, 73 changer transitions 0/351 dead transitions. [2022-12-06 07:22:23,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 351 transitions, 4853 flow [2022-12-06 07:22:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:22:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:22:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-06 07:22:23,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2022-12-06 07:22:23,501 INFO L175 Difference]: Start difference. First operand has 115 places, 186 transitions, 2463 flow. Second operand 5 states and 109 transitions. [2022-12-06 07:22:23,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 351 transitions, 4853 flow [2022-12-06 07:22:23,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 351 transitions, 4780 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-06 07:22:23,683 INFO L231 Difference]: Finished difference. Result has 120 places, 203 transitions, 2798 flow [2022-12-06 07:22:23,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2798, PETRI_PLACES=120, PETRI_TRANSITIONS=203} [2022-12-06 07:22:23,683 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2022-12-06 07:22:23,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:23,684 INFO L89 Accepts]: Start accepts. Operand has 120 places, 203 transitions, 2798 flow [2022-12-06 07:22:23,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:23,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:23,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 203 transitions, 2798 flow [2022-12-06 07:22:23,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 203 transitions, 2798 flow [2022-12-06 07:22:23,870 INFO L130 PetriNetUnfolder]: 1174/2186 cut-off events. [2022-12-06 07:22:23,871 INFO L131 PetriNetUnfolder]: For 26381/34046 co-relation queries the response was YES. [2022-12-06 07:22:23,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14572 conditions, 2186 events. 1174/2186 cut-off events. For 26381/34046 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 15280 event pairs, 512 based on Foata normal form. 67/1906 useless extension candidates. Maximal degree in co-relation 14189. Up to 1202 conditions per place. [2022-12-06 07:22:23,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 203 transitions, 2798 flow [2022-12-06 07:22:23,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 2012 [2022-12-06 07:22:23,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:23,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L52-1-->thread2EXIT: Formula: (and (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_4|) (= |v_thread2Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_10} OutVars{~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_4|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [470] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_95 4294967296) (mod v_~n~0_53 4294967296)) (= (* v_~x1~0_95 128) v_~x1~0_93)) InVars {~n~0=v_~n~0_53, ~x1~0=v_~x1~0_95} OutVars{~n~0=v_~n~0_53, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:22:24,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:22:24,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 669 [2022-12-06 07:22:24,353 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 203 transitions, 2897 flow [2022-12-06 07:22:24,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:22:24,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:24,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:24,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:22:24,354 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:22:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 653387422, now seen corresponding path program 1 times [2022-12-06 07:22:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651250629] [2022-12-06 07:22:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:22:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651250629] [2022-12-06 07:22:24,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651250629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:22:24,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:22:24,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:22:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000553266] [2022-12-06 07:22:24,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:22:24,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:22:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:22:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:22:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:22:24,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:22:24,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 203 transitions, 2897 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:22:24,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:22:24,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:22:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:22:26,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:29,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:30,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:33,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:34,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:37,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:39,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:22:39,958 INFO L130 PetriNetUnfolder]: 6026/8437 cut-off events. [2022-12-06 07:22:39,959 INFO L131 PetriNetUnfolder]: For 107504/107504 co-relation queries the response was YES. [2022-12-06 07:22:39,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63440 conditions, 8437 events. 6026/8437 cut-off events. For 107504/107504 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 42015 event pairs, 1124 based on Foata normal form. 194/8617 useless extension candidates. Maximal degree in co-relation 62355. Up to 5449 conditions per place. [2022-12-06 07:22:40,008 INFO L137 encePairwiseOnDemand]: 44/65 looper letters, 250 selfloop transitions, 35 changer transitions 3/288 dead transitions. [2022-12-06 07:22:40,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 288 transitions, 4593 flow [2022-12-06 07:22:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:22:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:22:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-06 07:22:40,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:22:40,009 INFO L175 Difference]: Start difference. First operand has 120 places, 203 transitions, 2897 flow. Second operand 4 states and 104 transitions. [2022-12-06 07:22:40,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 288 transitions, 4593 flow [2022-12-06 07:22:40,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 288 transitions, 4381 flow, removed 74 selfloop flow, removed 1 redundant places. [2022-12-06 07:22:40,198 INFO L231 Difference]: Finished difference. Result has 124 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2920, PETRI_PLACES=124, PETRI_TRANSITIONS=207} [2022-12-06 07:22:40,199 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 90 predicate places. [2022-12-06 07:22:40,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:22:40,199 INFO L89 Accepts]: Start accepts. Operand has 124 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:22:40,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:22:40,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,434 INFO L130 PetriNetUnfolder]: 1413/2585 cut-off events. [2022-12-06 07:22:40,434 INFO L131 PetriNetUnfolder]: For 29770/36963 co-relation queries the response was YES. [2022-12-06 07:22:40,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17645 conditions, 2585 events. 1413/2585 cut-off events. For 29770/36963 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 18426 event pairs, 581 based on Foata normal form. 56/2252 useless extension candidates. Maximal degree in co-relation 17238. Up to 1369 conditions per place. [2022-12-06 07:22:40,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 1988 [2022-12-06 07:22:40,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:22:40,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 07:22:40,468 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 207 transitions, 2920 flow [2022-12-06 07:22:40,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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:22:40,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:22:40,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:22:40,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:22:40,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:22:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:22:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1746089658, now seen corresponding path program 1 times [2022-12-06 07:22:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:22:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818504026] [2022-12-06 07:22:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:40,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:22:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:22:41,212 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:22:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:22:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818504026] [2022-12-06 07:22:41,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818504026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:22:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407179810] [2022-12-06 07:22:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:22:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:22:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:22:41,216 INFO L229 MonitoredProcess]: Starting monitored process 8 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:22:41,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 07:24:07,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:24:07,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:24:08,541 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 [2022-12-06 07:24:08,725 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2022-12-06 07:24:08,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137 [2022-12-06 07:24:08,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 07:24:08,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:24:08,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-12-06 07:24:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451325572] [2022-12-06 07:24:08,731 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:08,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:24:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:24:08,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:24:08,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:24:08,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 207 transitions, 2920 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:08,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:08,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:24:08,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:08,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 07:24:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:24:08,734 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 07:24:08,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 07:24:08,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 07:24:08,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 07:24:08,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 07:24:08,737 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:08,741 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:24:08,741 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:24:08,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:24:08 BasicIcfg [2022-12-06 07:24:08,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:24:08,745 INFO L158 Benchmark]: Toolchain (without parser) took 860528.35ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 835.7MB). Free memory was 157.4MB in the beginning and 702.3MB in the end (delta: -544.9MB). Peak memory consumption was 292.0MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,745 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:24:08,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.77ms. Allocated memory is still 181.4MB. Free memory was 157.4MB in the beginning and 145.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 181.4MB. Free memory was 145.6MB in the beginning and 144.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,746 INFO L158 Benchmark]: Boogie Preprocessor took 34.78ms. Allocated memory is still 181.4MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,746 INFO L158 Benchmark]: RCFGBuilder took 505.85ms. Allocated memory is still 181.4MB. Free memory was 142.4MB in the beginning and 126.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,747 INFO L158 Benchmark]: TraceAbstraction took 859683.62ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 835.7MB). Free memory was 125.6MB in the beginning and 702.3MB in the end (delta: -576.7MB). Peak memory consumption was 260.6MB. Max. memory is 8.0GB. [2022-12-06 07:24:08,748 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.12ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.77ms. Allocated memory is still 181.4MB. Free memory was 157.4MB in the beginning and 145.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 181.4MB. Free memory was 145.6MB in the beginning and 144.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.78ms. Allocated memory is still 181.4MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 505.85ms. Allocated memory is still 181.4MB. Free memory was 142.4MB in the beginning and 126.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 859683.62ms. Allocated memory was 181.4MB in the beginning and 1.0GB in the end (delta: 835.7MB). Free memory was 125.6MB in the beginning and 702.3MB in the end (delta: -576.7MB). Peak memory consumption was 260.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 129 PlacesBefore, 34 PlacesAfterwards, 126 TransitionsBefore, 25 TransitionsAfterwards, 3312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 53 ConcurrentYvCompositions, 6 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 1721, 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: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, 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: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, 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: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, 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: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, 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: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, 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: 1721, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1721, unknown conditional: 0, unknown unconditional: 1721] , Statistics on independence cache: Total cache size (in pairs): 2951, Positive cache size: 2951, Positive conditional cache size: 0, Positive unconditional cache size: 2951, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 20, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 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: 12, 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: 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] , 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: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 19, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 86 PlacesBefore, 86 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1408 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, 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: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 41, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 97 PlacesBefore, 96 PlacesAfterwards, 183 TransitionsBefore, 182 TransitionsAfterwards, 1654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 95, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 132, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 1780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 114 PlacesBefore, 114 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 1898 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 198, 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: 198, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 198, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 215, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 215, Positive conditional cache size: 215, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 120 PlacesBefore, 120 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 2012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 468, independent: 468, independent conditional: 468, 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: 468, independent: 468, independent conditional: 468, 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: 468, independent: 468, independent conditional: 468, 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: 468, independent: 468, independent conditional: 468, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 468, independent: 436, independent conditional: 436, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 256, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 1988 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 256, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 859.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 537.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 170 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 442.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1161 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 439.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4259 IncrementalHoareTripleChecker+Invalid, 4589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 0 mSDtfsCounter, 4259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 119.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2920occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 152.1s SatisfiabilityAnalysisTime, 67.4s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 608 ConstructedInterpolants, 0 QuantifiedInterpolants, 17662 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1216 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 10/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown