/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:59:46,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:59:46,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:59:46,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:59:46,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:59:46,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:59:46,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:59:46,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:59:46,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:59:46,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:59:46,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:59:46,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:59:46,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:59:46,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:59:46,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:59:46,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:59:46,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:59:46,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:59:46,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:59:46,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:59:46,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:59:46,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:59:46,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:59:46,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:59:47,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:59:47,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:59:47,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:59:47,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:59:47,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:59:47,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:59:47,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:59:47,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:59:47,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:59:47,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:59:47,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:59:47,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:59:47,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:59:47,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:59:47,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:59:47,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:59:47,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:59:47,016 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:59:47,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:59:47,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:59:47,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:59:47,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:59:47,048 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:59:47,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:59:47,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:59:47,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:59:47,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:59:47,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:59:47,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:59:47,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:47,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:59:47,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:59:47,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:59:47,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:59:47,052 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:59:47,052 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 04:59:47,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:59:47,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:59:47,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:59:47,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:59:47,365 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:59:47,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-12-06 04:59:48,430 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:59:48,624 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:59:48,626 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-12-06 04:59:48,635 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274efe6d1/195791b592844b7b88f1ae9aaefe4bd1/FLAGf94e61abd [2022-12-06 04:59:48,650 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/274efe6d1/195791b592844b7b88f1ae9aaefe4bd1 [2022-12-06 04:59:48,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:59:48,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:59:48,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:48,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:59:48,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:59:48,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba826b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48, skipping insertion in model container [2022-12-06 04:59:48,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:59:48,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:59:48,801 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-exp2x6.wvr.c[2453,2466] [2022-12-06 04:59:48,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:48,810 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:59:48,824 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-exp2x6.wvr.c[2453,2466] [2022-12-06 04:59:48,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:48,834 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:59:48,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48 WrapperNode [2022-12-06 04:59:48,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:48,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:48,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:59:48,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:59:48,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,870 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 04:59:48,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:48,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:59:48,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:59:48,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:59:48,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:59:48,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:59:48,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:59:48,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:59:48,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (1/1) ... [2022-12-06 04:59:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:48,961 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 04:59:48,978 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 04:59:49,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:59:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 04:59:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 04:59:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 04:59:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 04:59:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 04:59:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 04:59:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 04:59:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:59:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:59:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:59:49,006 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 04:59:49,090 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:59:49,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:59:49,272 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:59:49,277 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:59:49,277 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 04:59:49,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:49 BoogieIcfgContainer [2022-12-06 04:59:49,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:59:49,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:59:49,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:59:49,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:59:49,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:48" (1/3) ... [2022-12-06 04:59:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce274d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:49, skipping insertion in model container [2022-12-06 04:59:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:48" (2/3) ... [2022-12-06 04:59:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce274d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:49, skipping insertion in model container [2022-12-06 04:59:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:49" (3/3) ... [2022-12-06 04:59:49,283 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2022-12-06 04:59:49,306 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:59:49,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:59:49,306 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:59:49,389 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 04:59:49,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 130 transitions, 292 flow [2022-12-06 04:59:49,485 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-06 04:59:49,485 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:59:49,490 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 3. Compared 89 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:59:49,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 130 transitions, 292 flow [2022-12-06 04:59:49,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2022-12-06 04:59:49,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:49,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 114 transitions, 252 flow [2022-12-06 04:59:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 252 flow [2022-12-06 04:59:49,543 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2022-12-06 04:59:49,543 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:59:49,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 114 events. 10/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:59:49,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 252 flow [2022-12-06 04:59:49,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 2160 [2022-12-06 04:59:53,719 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-06 04:59:53,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:59:53,735 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;@732b9e1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:59:53,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:59:53,761 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 04:59:53,762 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:59:53,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:53,762 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 04:59:53,763 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 04:59:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash 223304526, now seen corresponding path program 1 times [2022-12-06 04:59:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:53,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515639345] [2022-12-06 04:59:53,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:54,216 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 04:59:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515639345] [2022-12-06 04:59:54,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515639345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:54,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:54,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:59:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68124493] [2022-12-06 04:59:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:54,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:59:54,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:54,244 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 04:59:54,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:54,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:54,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:54,372 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-06 04:59:54,372 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 04:59:54,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1772 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 04:59:54,378 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-06 04:59:54,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-06 04:59:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:59:54,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 04:59:54,393 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:59:54,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-06 04:59:54,396 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 04:59:54,398 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,400 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 04:59:54,404 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 04:59:54,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:54,405 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:54,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:54,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,411 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0][18], [136#true, 26#L38-1true, 124#L60-1true, 77#L49-1true, 16#L71-1true, 53#L97-4true, Black: 138#(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))))]) [2022-12-06 04:59:54,411 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,411 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,411 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,411 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,413 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-06 04:59:54,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:54,414 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 04:59:54,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 04:59:54,415 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:54,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:59:54,416 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-06 04:59:54,416 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 04:59:54,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:54,417 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 04:59:54,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:59:54,417 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 04:59:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash -965557640, now seen corresponding path program 1 times [2022-12-06 04:59:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:54,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521848758] [2022-12-06 04:59:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:54,601 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 04:59:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521848758] [2022-12-06 04:59:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521848758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:54,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:54,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654064303] [2022-12-06 04:59:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:54,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:54,605 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 04:59:54,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:54,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:54,775 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2022-12-06 04:59:54,775 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 04:59:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1833 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2022-12-06 04:59:54,778 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2022-12-06 04:59:54,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-06 04:59:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:59:54,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 04:59:54,780 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:59:54,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-06 04:59:54,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:54,782 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,782 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-06 04:59:54,782 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 04:59:54,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:54,782 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:54,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:54,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0][24], [Black: 142#(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)), 26#L38-1true, 124#L60-1true, 140#true, 16#L71-1true, 77#L49-1true, 53#L97-4true, Black: 138#(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))))]) [2022-12-06 04:59:54,787 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,787 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,787 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,787 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 04:59:54,791 INFO L130 PetriNetUnfolder]: 39/88 cut-off events. [2022-12-06 04:59:54,791 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:59:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 88 events. 39/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 124. Up to 38 conditions per place. [2022-12-06 04:59:54,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 04:59:54,793 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:54,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:59:54,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-06 04:59:54,794 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 04:59:54,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:54,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] [2022-12-06 04:59:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:59:54,794 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 04:59:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1782132831, now seen corresponding path program 1 times [2022-12-06 04:59:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661392478] [2022-12-06 04:59:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:54,907 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 04:59:54,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:54,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661392478] [2022-12-06 04:59:54,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661392478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:54,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:54,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:54,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495170196] [2022-12-06 04:59:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:54,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:54,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:54,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:54,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:54,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 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 04:59:54,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:54,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:54,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:55,045 INFO L130 PetriNetUnfolder]: 657/915 cut-off events. [2022-12-06 04:59:55,045 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-06 04:59:55,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 915 events. 657/915 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2762 event pairs, 55 based on Foata normal form. 32/947 useless extension candidates. Maximal degree in co-relation 841. Up to 349 conditions per place. [2022-12-06 04:59:55,050 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-06 04:59:55,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 85 transitions, 471 flow [2022-12-06 04:59:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 04:59:55,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 04:59:55,051 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 5 states and 72 transitions. [2022-12-06 04:59:55,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 85 transitions, 471 flow [2022-12-06 04:59:55,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 85 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:55,053 INFO L231 Difference]: Finished difference. Result has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=36, PETRI_TRANSITIONS=41} [2022-12-06 04:59:55,054 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 04:59:55,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:55,054 INFO L89 Accepts]: Start accepts. Operand has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:55,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:55,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,061 INFO L130 PetriNetUnfolder]: 53/110 cut-off events. [2022-12-06 04:59:55,061 INFO L131 PetriNetUnfolder]: For 50/74 co-relation queries the response was YES. [2022-12-06 04:59:55,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 110 events. 53/110 cut-off events. For 50/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 240 event pairs, 1 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 231. Up to 50 conditions per place. [2022-12-06 04:59:55,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 04:59:55,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:55,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:59:55,064 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 41 transitions, 192 flow [2022-12-06 04:59:55,064 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 04:59:55,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:55,064 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 04:59:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:59:55,065 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 04:59:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 590342650, now seen corresponding path program 1 times [2022-12-06 04:59:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:55,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025394947] [2022-12-06 04:59:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:55,192 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 04:59:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:55,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025394947] [2022-12-06 04:59:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025394947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044468858] [2022-12-06 04:59:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:55,213 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 04:59:55,215 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 04:59:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:55,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:55,685 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 04:59:55,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:55,744 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 04:59:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044468858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:55,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:55,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 04:59:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075103209] [2022-12-06 04:59:55,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:55,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:55,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 41 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 04:59:55,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:55,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:55,997 INFO L130 PetriNetUnfolder]: 807/1127 cut-off events. [2022-12-06 04:59:55,997 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2022-12-06 04:59:55,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1127 events. 807/1127 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3519 event pairs, 223 based on Foata normal form. 30/1127 useless extension candidates. Maximal degree in co-relation 1708. Up to 509 conditions per place. [2022-12-06 04:59:56,003 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-06 04:59:56,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 85 transitions, 512 flow [2022-12-06 04:59:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 04:59:56,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.592 [2022-12-06 04:59:56,005 INFO L175 Difference]: Start difference. First operand has 36 places, 41 transitions, 192 flow. Second operand 5 states and 74 transitions. [2022-12-06 04:59:56,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 85 transitions, 512 flow [2022-12-06 04:59:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 85 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:59:56,009 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 04:59:56,009 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 04:59:56,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:56,010 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:56,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:56,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,021 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2022-12-06 04:59:56,021 INFO L131 PetriNetUnfolder]: For 153/180 co-relation queries the response was YES. [2022-12-06 04:59:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 130 events. 58/130 cut-off events. For 153/180 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 339 event pairs, 4 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 331. Up to 58 conditions per place. [2022-12-06 04:59:56,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 04:59:56,025 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:56,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 04:59:56,026 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 256 flow [2022-12-06 04:59:56,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 04:59:56,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:56,026 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 04:59:56,035 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 04:59:56,235 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 04:59:56,235 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 04:59:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1133811226, now seen corresponding path program 2 times [2022-12-06 04:59:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:56,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079258546] [2022-12-06 04:59:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:56,425 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 04:59:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079258546] [2022-12-06 04:59:56,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079258546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:56,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628761689] [2022-12-06 04:59:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:56,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:56,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:56,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 256 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 04:59:56,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:56,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:56,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:56,601 INFO L130 PetriNetUnfolder]: 793/1113 cut-off events. [2022-12-06 04:59:56,601 INFO L131 PetriNetUnfolder]: For 1791/1791 co-relation queries the response was YES. [2022-12-06 04:59:56,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1113 events. 793/1113 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3570 event pairs, 135 based on Foata normal form. 14/1097 useless extension candidates. Maximal degree in co-relation 3069. Up to 907 conditions per place. [2022-12-06 04:59:56,606 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2022-12-06 04:59:56,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 495 flow [2022-12-06 04:59:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 04:59:56,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 04:59:56,608 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 256 flow. Second operand 4 states and 61 transitions. [2022-12-06 04:59:56,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 495 flow [2022-12-06 04:59:56,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 483 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:56,617 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2022-12-06 04:59:56,620 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 04:59:56,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:56,620 INFO L89 Accepts]: Start accepts. Operand has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:56,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:56,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,628 INFO L130 PetriNetUnfolder]: 57/128 cut-off events. [2022-12-06 04:59:56,628 INFO L131 PetriNetUnfolder]: For 137/172 co-relation queries the response was YES. [2022-12-06 04:59:56,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 128 events. 57/128 cut-off events. For 137/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 4 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 337. Up to 54 conditions per place. [2022-12-06 04:59:56,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 04:59:56,632 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:56,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:59:56,634 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 280 flow [2022-12-06 04:59:56,635 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 04:59:56,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:56,635 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 04:59:56,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:59:56,635 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 04:59:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash -3755773, now seen corresponding path program 2 times [2022-12-06 04:59:56,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:56,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856216250] [2022-12-06 04:59:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:56,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:56,761 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 04:59:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856216250] [2022-12-06 04:59:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856216250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:56,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185736250] [2022-12-06 04:59:56,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:59:56,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:56,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:56,782 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 04:59:56,811 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 04:59:56,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:59:56,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:59:56,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:56,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:57,045 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 04:59:57,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:57,097 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 04:59:57,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185736250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:57,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:57,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 04:59:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928307531] [2022-12-06 04:59:57,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:57,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:57,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:59:57,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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 04:59:57,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:57,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:59:57,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:57,282 INFO L130 PetriNetUnfolder]: 881/1229 cut-off events. [2022-12-06 04:59:57,282 INFO L131 PetriNetUnfolder]: For 1777/1777 co-relation queries the response was YES. [2022-12-06 04:59:57,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 1229 events. 881/1229 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3890 event pairs, 203 based on Foata normal form. 28/1257 useless extension candidates. Maximal degree in co-relation 3347. Up to 605 conditions per place. [2022-12-06 04:59:57,288 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 73 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2022-12-06 04:59:57,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 589 flow [2022-12-06 04:59:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 04:59:57,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.544 [2022-12-06 04:59:57,289 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 280 flow. Second operand 5 states and 68 transitions. [2022-12-06 04:59:57,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 589 flow [2022-12-06 04:59:57,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:57,292 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 332 flow [2022-12-06 04:59:57,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-06 04:59:57,293 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 04:59:57,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:57,293 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 332 flow [2022-12-06 04:59:57,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:57,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:57,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 332 flow [2022-12-06 04:59:57,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 332 flow [2022-12-06 04:59:57,302 INFO L130 PetriNetUnfolder]: 71/146 cut-off events. [2022-12-06 04:59:57,302 INFO L131 PetriNetUnfolder]: For 245/290 co-relation queries the response was YES. [2022-12-06 04:59:57,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 146 events. 71/146 cut-off events. For 245/290 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 381 event pairs, 1 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 450. Up to 71 conditions per place. [2022-12-06 04:59:57,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 332 flow [2022-12-06 04:59:57,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-06 04:59:57,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] L71-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_7 4294967296) (mod v_~n~0_In_3 4294967296)))) InVars {~n~0=v_~n~0_In_3, ~x4~0=v_~x4~0_In_7} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_7, ~n~0=v_~n~0_In_3, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] [2022-12-06 04:59:57,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:57,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 04:59:57,350 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 330 flow [2022-12-06 04:59:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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 04:59:57,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:57,351 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 04:59:57,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 04:59:57,555 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,SelfDestructingSolverStorable5 [2022-12-06 04:59:57,556 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 04:59:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1491697753, now seen corresponding path program 1 times [2022-12-06 04:59:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:57,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975686410] [2022-12-06 04:59:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:57,681 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 04:59:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975686410] [2022-12-06 04:59:57,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975686410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:57,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713147993] [2022-12-06 04:59:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:57,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:57,683 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 04:59:57,685 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 04:59:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:57,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:57,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:57,865 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 04:59:57,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:57,896 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 04:59:57,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713147993] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:57,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:57,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 04:59:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986748480] [2022-12-06 04:59:57,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:57,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:57,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:59:57,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 04:59:57,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:57,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:59:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:58,173 INFO L130 PetriNetUnfolder]: 1687/2313 cut-off events. [2022-12-06 04:59:58,174 INFO L131 PetriNetUnfolder]: For 8200/8200 co-relation queries the response was YES. [2022-12-06 04:59:58,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 2313 events. 1687/2313 cut-off events. For 8200/8200 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8352 event pairs, 325 based on Foata normal form. 98/2411 useless extension candidates. Maximal degree in co-relation 7853. Up to 1067 conditions per place. [2022-12-06 04:59:58,187 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 121 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2022-12-06 04:59:58,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 131 transitions, 1118 flow [2022-12-06 04:59:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 04:59:58,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-06 04:59:58,188 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 330 flow. Second operand 5 states and 86 transitions. [2022-12-06 04:59:58,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 131 transitions, 1118 flow [2022-12-06 04:59:58,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 131 transitions, 1056 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:58,202 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-06 04:59:58,203 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-06 04:59:58,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:58,203 INFO L89 Accepts]: Start accepts. Operand has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:58,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:58,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,221 INFO L130 PetriNetUnfolder]: 144/301 cut-off events. [2022-12-06 04:59:58,221 INFO L131 PetriNetUnfolder]: For 451/537 co-relation queries the response was YES. [2022-12-06 04:59:58,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 301 events. 144/301 cut-off events. For 451/537 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1159 event pairs, 7 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 974. Up to 163 conditions per place. [2022-12-06 04:59:58,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 04:59:58,227 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:58,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:59:58,229 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 374 flow [2022-12-06 04:59:58,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 04:59:58,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:58,229 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 04:59:58,234 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 04:59:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:58,434 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 04:59:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash 174140023, now seen corresponding path program 1 times [2022-12-06 04:59:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:58,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316292671] [2022-12-06 04:59:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:58,936 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 04:59:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:58,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316292671] [2022-12-06 04:59:58,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316292671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:58,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926173355] [2022-12-06 04:59:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:58,938 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 04:59:58,940 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 05:00:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:02,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:00:02,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:05,786 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 05:00:05,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:00:07,666 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 05:00:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926173355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:00:07,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:00:07,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:00:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616378883] [2022-12-06 05:00:07,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:00:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:00:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:00:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:00:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=110, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:00:07,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:00:07,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 374 flow. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 05:00:07,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:00:07,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:00:07,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:00:09,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:00:48,934 WARN L233 SmtUtils]: Spent 39.54s on a formula simplification. DAG size of input: 73 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:00:50,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:00:52,101 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 05:00:54,759 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 05:00:56,766 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 05:00:59,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 05:01:01,133 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 05:01:03,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 05:01:05,173 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 05:01:07,253 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 05:01:11,571 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 05:01:13,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:14,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:16,709 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 05:01:18,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:20,922 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 05:01:22,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:25,039 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 05:01:27,043 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 05:01:30,332 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 05:01:32,591 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 05:01:35,573 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 05:01:37,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:37,249 INFO L130 PetriNetUnfolder]: 1791/2462 cut-off events. [2022-12-06 05:01:37,249 INFO L131 PetriNetUnfolder]: For 6819/6819 co-relation queries the response was YES. [2022-12-06 05:01:37,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11409 conditions, 2462 events. 1791/2462 cut-off events. For 6819/6819 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9060 event pairs, 353 based on Foata normal form. 15/2477 useless extension candidates. Maximal degree in co-relation 8428. Up to 2103 conditions per place. [2022-12-06 05:01:37,262 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 80 selfloop transitions, 20 changer transitions 8/108 dead transitions. [2022-12-06 05:01:37,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 854 flow [2022-12-06 05:01:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:01:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:01:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 05:01:37,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 05:01:37,264 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 374 flow. Second operand 6 states and 87 transitions. [2022-12-06 05:01:37,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 854 flow [2022-12-06 05:01:37,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 852 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 05:01:37,285 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,285 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-12-06 05:01:37,286 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-06 05:01:37,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:37,287 INFO L89 Accepts]: Start accepts. Operand has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:37,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:37,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,326 INFO L130 PetriNetUnfolder]: 150/325 cut-off events. [2022-12-06 05:01:37,326 INFO L131 PetriNetUnfolder]: For 635/738 co-relation queries the response was YES. [2022-12-06 05:01:37,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 325 events. 150/325 cut-off events. For 635/738 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1345 event pairs, 5 based on Foata normal form. 2/303 useless extension candidates. Maximal degree in co-relation 1150. Up to 173 conditions per place. [2022-12-06 05:01:37,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-06 05:01:37,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:01:37,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 05:01:37,333 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 535 flow [2022-12-06 05:01:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 05:01:37,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:37,333 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 05:01:37,341 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 05:01:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:37,539 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 05:01:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1110506624, now seen corresponding path program 2 times [2022-12-06 05:01:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:37,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486218968] [2022-12-06 05:01:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:37,637 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 05:01:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486218968] [2022-12-06 05:01:37,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486218968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56490548] [2022-12-06 05:01:37,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:01:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:37,653 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 05:01:37,654 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 05:01:37,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:01:37,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:01:37,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:01:37,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:37,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:37,829 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 05:01:37,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56490548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:37,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:37,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:01:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943995698] [2022-12-06 05:01:37,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:01:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:01:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:01:37,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:01:37,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:37,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:37,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:01:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:38,140 INFO L130 PetriNetUnfolder]: 2235/3064 cut-off events. [2022-12-06 05:01:38,141 INFO L131 PetriNetUnfolder]: For 12721/12721 co-relation queries the response was YES. [2022-12-06 05:01:38,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14938 conditions, 3064 events. 2235/3064 cut-off events. For 12721/12721 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11619 event pairs, 555 based on Foata normal form. 72/3136 useless extension candidates. Maximal degree in co-relation 12678. Up to 1679 conditions per place. [2022-12-06 05:01:38,163 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 127 selfloop transitions, 16 changer transitions 0/143 dead transitions. [2022-12-06 05:01:38,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 143 transitions, 1315 flow [2022-12-06 05:01:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:01:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:01:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 05:01:38,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-06 05:01:38,164 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 535 flow. Second operand 5 states and 86 transitions. [2022-12-06 05:01:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 143 transitions, 1315 flow [2022-12-06 05:01:38,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 1276 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 05:01:38,177 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 566 flow [2022-12-06 05:01:38,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=566, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2022-12-06 05:01:38,178 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2022-12-06 05:01:38,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:38,178 INFO L89 Accepts]: Start accepts. Operand has 66 places, 67 transitions, 566 flow [2022-12-06 05:01:38,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:38,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:38,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 67 transitions, 566 flow [2022-12-06 05:01:38,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 566 flow [2022-12-06 05:01:38,200 INFO L130 PetriNetUnfolder]: 201/416 cut-off events. [2022-12-06 05:01:38,201 INFO L131 PetriNetUnfolder]: For 1293/1406 co-relation queries the response was YES. [2022-12-06 05:01:38,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 416 events. 201/416 cut-off events. For 1293/1406 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1852 event pairs, 16 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1577. Up to 213 conditions per place. [2022-12-06 05:01:38,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 566 flow [2022-12-06 05:01:38,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 786 [2022-12-06 05:01:38,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:01:38,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:01:38,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 05:01:38,253 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 576 flow [2022-12-06 05:01:38,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:38,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:38,254 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 05:01:38,261 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 05:01:38,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:38,459 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 05:01:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -603099771, now seen corresponding path program 1 times [2022-12-06 05:01:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:38,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213653573] [2022-12-06 05:01:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:40,862 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 05:01:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213653573] [2022-12-06 05:01:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213653573] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520730102] [2022-12-06 05:01:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:40,871 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 05:01:40,881 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 05:01:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:41,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:01:41,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:01:44,211 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 05:01:44,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:44,614 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 05:01:44,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520730102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:44,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:44,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-06 05:01:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21627915] [2022-12-06 05:01:44,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:01:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:01:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2022-12-06 05:01:44,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:01:44,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 576 flow. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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 05:01:44,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:44,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:01:44,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:48,344 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 05:01:50,355 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 05:01:52,498 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 05:01:57,733 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 05:01:59,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:01,234 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 05:02:04,563 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 05:02:05,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:10,002 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 05:02:12,817 INFO L130 PetriNetUnfolder]: 2931/4000 cut-off events. [2022-12-06 05:02:12,817 INFO L131 PetriNetUnfolder]: For 20554/20554 co-relation queries the response was YES. [2022-12-06 05:02:12,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21097 conditions, 4000 events. 2931/4000 cut-off events. For 20554/20554 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15909 event pairs, 491 based on Foata normal form. 2/4002 useless extension candidates. Maximal degree in co-relation 16129. Up to 3108 conditions per place. [2022-12-06 05:02:12,837 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 126 selfloop transitions, 34 changer transitions 5/165 dead transitions. [2022-12-06 05:02:12,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 165 transitions, 1524 flow [2022-12-06 05:02:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:02:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:02:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 05:02:12,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 05:02:12,839 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 576 flow. Second operand 8 states and 123 transitions. [2022-12-06 05:02:12,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 165 transitions, 1524 flow [2022-12-06 05:02:12,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 165 transitions, 1458 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:02:12,866 INFO L231 Difference]: Finished difference. Result has 75 places, 92 transitions, 908 flow [2022-12-06 05:02:12,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=908, PETRI_PLACES=75, PETRI_TRANSITIONS=92} [2022-12-06 05:02:12,867 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2022-12-06 05:02:12,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:02:12,867 INFO L89 Accepts]: Start accepts. Operand has 75 places, 92 transitions, 908 flow [2022-12-06 05:02:12,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:02:12,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:02:12,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 92 transitions, 908 flow [2022-12-06 05:02:12,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 92 transitions, 908 flow [2022-12-06 05:02:12,931 INFO L130 PetriNetUnfolder]: 322/624 cut-off events. [2022-12-06 05:02:12,931 INFO L131 PetriNetUnfolder]: For 2457/2772 co-relation queries the response was YES. [2022-12-06 05:02:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 624 events. 322/624 cut-off events. For 2457/2772 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2984 event pairs, 32 based on Foata normal form. 3/592 useless extension candidates. Maximal degree in co-relation 2722. Up to 337 conditions per place. [2022-12-06 05:02:12,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 92 transitions, 908 flow [2022-12-06 05:02:12,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 1060 [2022-12-06 05:02:12,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:02:13,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:02:13,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:02:13,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:02:13,060 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 92 transitions, 926 flow [2022-12-06 05:02:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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 05:02:13,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:02:13,061 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 05:02:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:02:13,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:13,261 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 05:02:13,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:02:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash -594175748, now seen corresponding path program 1 times [2022-12-06 05:02:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:02:13,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073153761] [2022-12-06 05:02:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:02:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:13,645 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 05:02:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:02:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073153761] [2022-12-06 05:02:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073153761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:02:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198256898] [2022-12-06 05:02:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:02:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:02:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:02:13,659 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 05:02:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:02:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:13,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:02:13,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:27,199 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 05:02:27,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:02:30,134 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 05:02:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198256898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:02:30,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:02:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 05:02:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972491184] [2022-12-06 05:02:30,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:02:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:02:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:02:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:02:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=100, Unknown=5, NotChecked=0, Total=156 [2022-12-06 05:02:30,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:02:30,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 92 transitions, 926 flow. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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 05:02:30,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:02:30,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:02:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:02:32,324 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 05:02:37,359 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 05:02:39,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:41,465 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 05:02:43,839 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 05:02:47,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:02:49,936 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 05:02:51,940 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 05:02:53,946 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 05:02:55,950 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 05:02:57,955 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 05:03:00,658 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 05:03:02,714 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 05:03:05,284 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 05:03:07,377 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 05:03:08,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:10,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:12,412 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 05:03:14,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:15,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:20,562 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 05:03:22,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 05:03:25,077 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 05:03:26,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:29,827 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 05:03:30,169 INFO L130 PetriNetUnfolder]: 4063/5592 cut-off events. [2022-12-06 05:03:30,170 INFO L131 PetriNetUnfolder]: For 26271/26271 co-relation queries the response was YES. [2022-12-06 05:03:30,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29355 conditions, 5592 events. 4063/5592 cut-off events. For 26271/26271 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24341 event pairs, 433 based on Foata normal form. 2/5594 useless extension candidates. Maximal degree in co-relation 27110. Up to 4128 conditions per place. [2022-12-06 05:03:30,194 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 212 selfloop transitions, 59 changer transitions 12/283 dead transitions. [2022-12-06 05:03:30,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 283 transitions, 2565 flow [2022-12-06 05:03:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:03:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:03:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-12-06 05:03:30,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018808777429467 [2022-12-06 05:03:30,195 INFO L175 Difference]: Start difference. First operand has 75 places, 92 transitions, 926 flow. Second operand 11 states and 192 transitions. [2022-12-06 05:03:30,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 283 transitions, 2565 flow [2022-12-06 05:03:30,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 283 transitions, 2481 flow, removed 42 selfloop flow, removed 0 redundant places. [2022-12-06 05:03:30,253 INFO L231 Difference]: Finished difference. Result has 91 places, 141 transitions, 1503 flow [2022-12-06 05:03:30,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1503, PETRI_PLACES=91, PETRI_TRANSITIONS=141} [2022-12-06 05:03:30,254 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 57 predicate places. [2022-12-06 05:03:30,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:03:30,254 INFO L89 Accepts]: Start accepts. Operand has 91 places, 141 transitions, 1503 flow [2022-12-06 05:03:30,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:03:30,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:03:30,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 141 transitions, 1503 flow [2022-12-06 05:03:30,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 141 transitions, 1503 flow [2022-12-06 05:03:30,296 INFO L130 PetriNetUnfolder]: 409/757 cut-off events. [2022-12-06 05:03:30,297 INFO L131 PetriNetUnfolder]: For 4161/5276 co-relation queries the response was YES. [2022-12-06 05:03:30,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 757 events. 409/757 cut-off events. For 4161/5276 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3526 event pairs, 19 based on Foata normal form. 17/715 useless extension candidates. Maximal degree in co-relation 3515. Up to 398 conditions per place. [2022-12-06 05:03:30,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 141 transitions, 1503 flow [2022-12-06 05:03:30,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 1702 [2022-12-06 05:03:30,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:03:30,401 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:03:30,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-06 05:03:30,401 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 141 transitions, 1515 flow [2022-12-06 05:03:30,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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 05:03:30,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:03:30,402 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 05:03:30,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 05:03:30,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:30,602 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 05:03:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:03:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1817282133, now seen corresponding path program 2 times [2022-12-06 05:03:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:03:30,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045697587] [2022-12-06 05:03:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:03:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:03:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:03:30,998 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 05:03:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:03:30,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045697587] [2022-12-06 05:03:30,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045697587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:03:30,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873850113] [2022-12-06 05:03:30,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:03:30,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:03:30,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:03:31,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:03:31,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:03:42,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:03:42,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:03:42,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:03:42,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:04:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:47,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:04:58,576 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 05:04:58,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873850113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:04:58,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:04:58,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:04:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828861314] [2022-12-06 05:04:58,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:04:58,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:04:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:04:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=157, Unknown=15, NotChecked=0, Total=240 [2022-12-06 05:04:58,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:04:58,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 141 transitions, 1515 flow. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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 05:04:58,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:58,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:04:58,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:06:24,234 WARN L233 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 89 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:06:26,496 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 05:06:29,353 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 05:06:31,361 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 05:06:33,367 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 05:06:35,888 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 05:06:38,559 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 05:06:40,955 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 05:06:42,963 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 05:06:45,360 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 05:06:47,370 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 05:06:50,681 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 05:06:52,702 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 05:06:54,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:07:01,676 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 05:07:03,798 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 05:07:13,187 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 05:07:15,615 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 05:07:17,628 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 05:07:19,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 05:07:21,755 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 05:07:24,503 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 05:07:26,513 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 05:07:51,660 WARN L233 SmtUtils]: Spent 13.00s on a formula simplification. DAG size of input: 65 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:07:53,664 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 05:07:56,066 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 05:07:58,111 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 05:08:00,119 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 05:08:02,129 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 05:08:04,137 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 05:08:07,142 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 05:08:09,154 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 05:08:11,284 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 05:08:13,545 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 05:08:23,756 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 05:08:25,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:08:27,577 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 05:08:37,280 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 05:09:18,706 WARN L233 SmtUtils]: Spent 15.14s on a formula simplification. DAG size of input: 66 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:09:21,526 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 05:09:23,534 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 05:09:25,649 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 05:09:27,777 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 05:09:31,573 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 05:09:33,580 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 05:09:35,588 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 05:10:09,021 WARN L233 SmtUtils]: Spent 12.87s on a formula simplification. DAG size of input: 78 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:10:11,025 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 05:10:13,031 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 05:10:15,074 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 05:10:16,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:18,719 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 05:10:20,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:22,777 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 05:10:24,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 05:10:27,653 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 05:10:29,688 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 05:10:31,697 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 05:10:33,822 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 05:10:35,827 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 05:10:37,866 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 05:10:41,115 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 05:10:43,121 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 05:10:44,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:48,774 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 05:10:50,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:10:52,639 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 05:10:54,972 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 05:10:56,983 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 05:10:58,990 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 05:11:01,234 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 05:11:03,529 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 05:11:06,188 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 05:11:07,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:11:09,667 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 05:11:11,674 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 05:11:12,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:11:14,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 05:11:17,303 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 05:11:19,496 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 05:11:21,508 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 05:11:23,611 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 05:11:26,388 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 05:11:29,942 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 05:11:31,315 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 05:11:33,318 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 05:11:34,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:11:36,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 05:11:39,107 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 05:11:45,509 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 05:11:47,526 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 05:11:48,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:11:50,940 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 05:11:53,102 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 05:12:01,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:12:04,439 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 05:12:06,450 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 05:12:07,950 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 05:12:10,240 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 05:12:13,279 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 05:12:15,345 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 05:12:17,551 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 05:12:19,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 05:12:21,649 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 05:12:24,184 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 05:12:26,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:12:28,307 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 05:12:30,345 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 05:12:32,661 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 05:12:35,472 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 05:12:37,492 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 05:12:39,499 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 05:13:00,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:13:02,785 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 05:13:05,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:13:09,129 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 05:13:11,912 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 05:13:14,320 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 05:13:15,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:13:17,629 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 05:13:17,899 INFO L130 PetriNetUnfolder]: 6155/8583 cut-off events. [2022-12-06 05:13:17,899 INFO L131 PetriNetUnfolder]: For 58602/58602 co-relation queries the response was YES. [2022-12-06 05:13:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50089 conditions, 8583 events. 6155/8583 cut-off events. For 58602/58602 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 41096 event pairs, 729 based on Foata normal form. 43/8612 useless extension candidates. Maximal degree in co-relation 47807. Up to 5982 conditions per place. [2022-12-06 05:13:17,967 INFO L137 encePairwiseOnDemand]: 10/32 looper letters, 283 selfloop transitions, 160 changer transitions 25/468 dead transitions. [2022-12-06 05:13:17,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 468 transitions, 4880 flow [2022-12-06 05:13:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:13:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:13:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 328 transitions. [2022-12-06 05:13:17,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 05:13:17,970 INFO L175 Difference]: Start difference. First operand has 91 places, 141 transitions, 1515 flow. Second operand 22 states and 328 transitions. [2022-12-06 05:13:17,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 468 transitions, 4880 flow [2022-12-06 05:13:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 468 transitions, 4771 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-06 05:13:18,156 INFO L231 Difference]: Finished difference. Result has 126 places, 275 transitions, 3466 flow [2022-12-06 05:13:18,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3466, PETRI_PLACES=126, PETRI_TRANSITIONS=275} [2022-12-06 05:13:18,156 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 92 predicate places. [2022-12-06 05:13:18,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:13:18,157 INFO L89 Accepts]: Start accepts. Operand has 126 places, 275 transitions, 3466 flow [2022-12-06 05:13:18,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:13:18,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:13:18,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 275 transitions, 3466 flow [2022-12-06 05:13:18,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 275 transitions, 3466 flow [2022-12-06 05:13:18,475 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][158], [1257#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 999#true, Black: 138#(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)))), 717#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 153#true, 65#thread1EXITtrue, Black: 142#(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: 147#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 150#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 46#thread2EXITtrue, Black: 286#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 206#(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: 291#(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)), 14#L98-1true, 16#L71-1true, 80#thread3EXITtrue, Black: 347#(and (< 0 (mod ~x3~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 4294967296))) 4294967296) 4294967296)) (mod ~n~0 4294967296))), Black: 447#(and (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 563#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1311#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), 294#true, Black: 1202#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1306#(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 (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1326#(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 (< (* 16 (mod ~x4~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (< (* 16 (mod ~x3~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (and (< (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0) 1)) (<= (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1253#(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))), Black: 1322#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~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))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 1308#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1328#(and (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 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)))), Black: 1314#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (<= (+ (mod (div ~x4~0 16) 4294967296) 1) (mod ~x3~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1316#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 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))), Black: 1318#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1206#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1157#(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: 614#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1300#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 707#(and (or (and (<= (+ 2 (* 16 ~x3~0) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ (* (- 1) ~x4~0) (* 16 ~x3~0)) 4294967296) 4294967296) ~n~0 ~x4~0)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (+ ~x3~0 (- 17895698)) 268435456) 4294967296)))) (<= (+ 2 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 68719476736) ~x4~0))) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x3~0 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x4~0 16) 0) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (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))) (< 0 (mod ~x1~0 4294967296))), 145#true, Black: 843#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 745#(and (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 901#(and (= (mod ~x3~0 16) 0) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (= (mod (div ~x3~0 16) 4294967296) (mod (div ~x4~0 16) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (< 0 (mod ~x1~0 4294967296))), 847#true, Black: 992#(and (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) ~n~0 (* (- 16) ~x4~0) ~x3~0) 4294967296)) (* 16 ~x4~0))) (= (mod ~x4~0 4294967296) (mod (div ~x3~0 16) 4294967296)) (= (mod ~x3~0 16) 0) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (or (<= (+ (* 268435456 (div ~x3~0 4294967296)) 1) (+ (* 268435456 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296)) ~x4~0)) (<= (+ 268435457 ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* ~x4~0 15) (* 268435456 (div ~x3~0 4294967296)) ~n~0 (* 4026531840 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296))))) (< 0 (mod ~x1~0 4294967296))), Black: 853#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), Black: 857#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 567#true, Black: 1003#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1)) (or (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ 3 ~x1~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)))), Black: 1109#(or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))), Black: 1105#(or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), Black: 1004#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))), Black: 1040#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod ~x3~0 4294967296)) (= (mod (div ~x2~0 16) 4294967296) (mod (div ~x1~0 16) 4294967296)) (= (mod ~x1~0 16) 0) (= (mod ~x2~0 16) 0) (< (mod (div ~x2~0 16) 4294967296) (mod ~n~0 4294967296))), Black: 1141#(and (or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))) (or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))]) [2022-12-06 05:13:18,485 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 05:13:18,485 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:13:18,485 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:13:18,485 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:13:18,500 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base][158], [1257#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 999#true, 66#L98-2true, 717#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 138#(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)))), 153#true, Black: 142#(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: 147#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 150#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 46#thread2EXITtrue, Black: 286#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 206#(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: 291#(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)), 16#L71-1true, 80#thread3EXITtrue, Black: 347#(and (< 0 (mod ~x3~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 4294967296))) 4294967296) 4294967296)) (mod ~n~0 4294967296))), Black: 447#(and (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 563#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1311#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1202#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), 294#true, Black: 1306#(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 (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1326#(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 (< (* 16 (mod ~x4~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (< (* 16 (mod ~x3~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (and (< (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0) 1)) (<= (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1253#(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))), Black: 1322#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~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))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 1308#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1328#(and (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 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)))), Black: 1314#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (<= (+ (mod (div ~x4~0 16) 4294967296) 1) (mod ~x3~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1316#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 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))), Black: 1318#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1206#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1157#(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: 1300#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 614#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 707#(and (or (and (<= (+ 2 (* 16 ~x3~0) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ (* (- 1) ~x4~0) (* 16 ~x3~0)) 4294967296) 4294967296) ~n~0 ~x4~0)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (+ ~x3~0 (- 17895698)) 268435456) 4294967296)))) (<= (+ 2 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 68719476736) ~x4~0))) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x3~0 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x4~0 16) 0) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (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))) (< 0 (mod ~x1~0 4294967296))), 145#true, Black: 843#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 745#(and (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 901#(and (= (mod ~x3~0 16) 0) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (= (mod (div ~x3~0 16) 4294967296) (mod (div ~x4~0 16) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 992#(and (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) ~n~0 (* (- 16) ~x4~0) ~x3~0) 4294967296)) (* 16 ~x4~0))) (= (mod ~x4~0 4294967296) (mod (div ~x3~0 16) 4294967296)) (= (mod ~x3~0 16) 0) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (or (<= (+ (* 268435456 (div ~x3~0 4294967296)) 1) (+ (* 268435456 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296)) ~x4~0)) (<= (+ 268435457 ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* ~x4~0 15) (* 268435456 (div ~x3~0 4294967296)) ~n~0 (* 4026531840 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296))))) (< 0 (mod ~x1~0 4294967296))), 847#true, Black: 853#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), Black: 857#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 567#true, Black: 1003#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1)) (or (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ 3 ~x1~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)))), Black: 1109#(or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))), Black: 1105#(or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), Black: 1004#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))), Black: 1040#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod ~x3~0 4294967296)) (= (mod (div ~x2~0 16) 4294967296) (mod (div ~x1~0 16) 4294967296)) (= (mod ~x1~0 16) 0) (= (mod ~x2~0 16) 0) (< (mod (div ~x2~0 16) 4294967296) (mod ~n~0 4294967296))), Black: 1141#(and (or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))) (or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))]) [2022-12-06 05:13:18,500 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:13:18,500 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:13:18,500 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:13:18,500 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:13:18,561 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([341] thread4EXIT-->L101-2: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_4 0) (= v_thread4Thread1of1ForFork3_thidvar1_4 0) (= v_thread4Thread1of1ForFork3_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem17#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread4Thread1of1ForFork3_thidvar4_4 0) (= v_thread4Thread1of1ForFork3_thidvar3_4 0)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4, thread4Thread1of1ForFork3_thidvar4=v_thread4Thread1of1ForFork3_thidvar4_4, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_5|} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4, thread4Thread1of1ForFork3_thidvar4=v_thread4Thread1of1ForFork3_thidvar4_4, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_5|} AuxVars[] AssignedVars[][273], [Black: 1316#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 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))), Black: 1318#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1206#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1157#(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)))), 999#true, Black: 614#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1300#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 707#(and (or (and (<= (+ 2 (* 16 ~x3~0) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div (+ (* (- 1) ~x4~0) (* 16 ~x3~0)) 4294967296) 4294967296) ~n~0 ~x4~0)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (+ ~x3~0 (- 17895698)) 268435456) 4294967296)))) (<= (+ 2 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 68719476736) ~x4~0))) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x3~0 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x4~0 16) 0) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (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))) (< 0 (mod ~x1~0 4294967296))), 1151#true, Black: 138#(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)))), 717#(and (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 843#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 153#true, Black: 745#(and (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 142#(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: 147#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 150#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), Black: 286#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 206#(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: 901#(and (= (mod ~x3~0 16) 0) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (= (mod (div ~x3~0 16) 4294967296) (mod (div ~x4~0 16) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 992#(and (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) ~n~0 (* (- 16) ~x4~0) ~x3~0) 4294967296)) (* 16 ~x4~0))) (= (mod ~x4~0 4294967296) (mod (div ~x3~0 16) 4294967296)) (= (mod ~x3~0 16) 0) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (or (<= (+ (* 268435456 (div ~x3~0 4294967296)) 1) (+ (* 268435456 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296)) ~x4~0)) (<= (+ 268435457 ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* ~x4~0 15) (* 268435456 (div ~x3~0 4294967296)) ~n~0 (* 4026531840 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296))))) (< 0 (mod ~x1~0 4294967296))), Black: 291#(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: 857#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (< 0 (mod ~x3~0 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 148#(<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))), 567#true, 853#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 71#L101-2true, Black: 347#(and (< 0 (mod ~x3~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 4294967296))) 4294967296) 4294967296)) (mod ~n~0 4294967296))), Black: 447#(and (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1257#(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)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), Black: 563#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 1311#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), 294#true, Black: 1202#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1306#(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 (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1003#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1)) (or (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ 3 ~x1~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0)))), Black: 1326#(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 (< (* 16 (mod ~x4~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (< (* 16 (mod ~x3~0 268435456)) (+ (mod ~x4~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 268435456))) 268435456) 4294967296))) (and (< (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0) 1)) (<= (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))) (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), Black: 1109#(or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))), Black: 1253#(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))), Black: 1105#(or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), Black: 1004#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))), Black: 1322#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~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))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 1040#(and (= (mod ~x3~0 4294967296) (mod ~x4~0 4294967296)) (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod ~x3~0 4294967296)) (= (mod (div ~x2~0 16) 4294967296) (mod (div ~x1~0 16) 4294967296)) (= (mod ~x1~0 16) 0) (= (mod ~x2~0 16) 0) (< (mod (div ~x2~0 16) 4294967296) (mod ~n~0 4294967296))), Black: 1308#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 1141#(and (or (and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0) (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296))) (< (+ (* 16 ~x1~0) (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div (* 16 ~x1~0) 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* 16 (mod ~x1~0 268435456)) (mod ~n~0 4294967296))) (or (and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0 1))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), Black: 1328#(and (or (< (* 16 (mod ~x3~0 268435456)) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (and (< (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 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)))), Black: 1314#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (<= (+ (mod (div ~x4~0 16) 4294967296) 1) (mod ~x3~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod (div ~x4~0 16) 4294967296) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0))]) [2022-12-06 05:13:18,575 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-06 05:13:18,575 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:13:18,575 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-12-06 05:13:18,575 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 05:13:18,622 INFO L130 PetriNetUnfolder]: 1877/3125 cut-off events. [2022-12-06 05:13:18,622 INFO L131 PetriNetUnfolder]: For 53352/58876 co-relation queries the response was YES. [2022-12-06 05:13:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23650 conditions, 3125 events. 1877/3125 cut-off events. For 53352/58876 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 19288 event pairs, 297 based on Foata normal form. 92/2801 useless extension candidates. Maximal degree in co-relation 23204. Up to 1370 conditions per place. [2022-12-06 05:13:18,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 275 transitions, 3466 flow [2022-12-06 05:13:18,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 2524 [2022-12-06 05:13:18,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:13:18,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0] and [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:13:18,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:13:18,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L71-1-->L60-1: Formula: (let ((.cse0 (mod v_~n~0_95 4294967296))) (and (= v_~x3~0_94 (* v_~x3~0_95 16)) (= |v_thread4Thread1of1ForFork3_#res.offset_17| 0) (not (< (mod v_~x4~0_100 4294967296) .cse0)) (= |v_thread4Thread1of1ForFork3_#res.base_17| 0) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_17|, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_17|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:13:18,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] L71-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_7 4294967296) (mod v_~n~0_In_3 4294967296)))) InVars {~n~0=v_~n~0_In_3, ~x4~0=v_~x4~0_In_7} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_7, ~n~0=v_~n~0_In_3, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] [2022-12-06 05:13:18,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] L71-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_7 4294967296) (mod v_~n~0_In_3 4294967296)))) InVars {~n~0=v_~n~0_In_3, ~x4~0=v_~x4~0_In_7} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_7, ~n~0=v_~n~0_In_3, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:13:19,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [440] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_11 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] [2022-12-06 05:13:19,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:13:19,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] [2022-12-06 05:13:19,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:13:19,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] [2022-12-06 05:13:19,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:13:19,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:13:19,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:13:19,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [440] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_11 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] [2022-12-06 05:13:19,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L71-1-->L60-1: Formula: (let ((.cse0 (mod v_~n~0_95 4294967296))) (and (= v_~x3~0_94 (* v_~x3~0_95 16)) (= |v_thread4Thread1of1ForFork3_#res.offset_17| 0) (not (< (mod v_~x4~0_100 4294967296) .cse0)) (= |v_thread4Thread1of1ForFork3_#res.base_17| 0) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_17|, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_17|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [461] L97-4-->L38-1: Formula: (and (= v_~x1~0_128 (* v_~x1~0_129 16)) (< (mod v_~x1~0_129 4294967296) (mod v_~n~0_127 4294967296)) (= (select (select |v_#memory_int_99| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) |v_ULTIMATE.start_main_#t~mem14#1_50|)) InVars {#memory_int=|v_#memory_int_99|, ~n~0=v_~n~0_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~x1~0=v_~x1~0_129, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_59|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_50|, #memory_int=|v_#memory_int_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_39|, ~n~0=v_~n~0_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~x1~0=v_~x1~0_128, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1, ~x1~0] [2022-12-06 05:13:19,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L71-1-->L60-1: Formula: (let ((.cse0 (mod v_~n~0_95 4294967296))) (and (= v_~x3~0_94 (* v_~x3~0_95 16)) (= |v_thread4Thread1of1ForFork3_#res.offset_17| 0) (not (< (mod v_~x4~0_100 4294967296) .cse0)) (= |v_thread4Thread1of1ForFork3_#res.base_17| 0) (< (mod v_~x3~0_95 4294967296) .cse0))) InVars {~x3~0=v_~x3~0_95, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95} OutVars{~x3~0=v_~x3~0_94, thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_17|, ~x4~0=v_~x4~0_100, ~n~0=v_~n~0_95, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_17|} AuxVars[] AssignedVars[~x3~0, thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [463] L97-4-->L49-1: Formula: (and (= (select (select |v_#memory_int_103| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41|) |v_ULTIMATE.start_main_#t~mem14#1_54|) (= (* 16 v_~x2~0_115) v_~x2~0_114) (< (mod v_~x2~0_115 4294967296) (mod v_~n~0_131 4294967296))) InVars {~x2~0=v_~x2~0_115, #memory_int=|v_#memory_int_103|, ~n~0=v_~n~0_131, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|} OutVars{~x2~0=v_~x2~0_114, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_63|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_54|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_43|, ~n~0=v_~n~0_131, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|} AuxVars[] AssignedVars[~x2~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:13:19,489 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:13:19,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1333 [2022-12-06 05:13:19,490 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 275 transitions, 3575 flow [2022-12-06 05:13:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 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 05:13:19,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:13:19,490 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 05:13:19,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:13:19,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 05:13:19,691 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 05:13:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:13:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash -206927591, now seen corresponding path program 1 times [2022-12-06 05:13:19,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:13:19,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155789514] [2022-12-06 05:13:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:13:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:13:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:13:19,811 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 05:13:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:13:19,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155789514] [2022-12-06 05:13:19,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155789514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:13:19,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86051103] [2022-12-06 05:13:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:13:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:13:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:13:19,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:13:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 05:14:26,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:14:26,277 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 05:14:27,304 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 05:14:27,471 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2022-12-06 05:14:27,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 05:14:27,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:14:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2022-12-06 05:14:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568829997] [2022-12-06 05:14:27,477 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 05:14:27,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:27,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:27,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:14:27,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 275 transitions, 3575 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 05:14:27,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:27,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:14:27,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:27,480 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 05:14:27,480 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2022-12-06 05:14:27,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 05:14:27,480 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 05:14:27,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 05:14:27,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 05:14:27,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 05:14:27,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 05:14:27,481 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-06 05:14:27,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:14:27,483 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:14:27,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:14:27 BasicIcfg [2022-12-06 05:14:27,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:14:27,485 INFO L158 Benchmark]: Toolchain (without parser) took 878832.01ms. Allocated memory was 175.1MB in the beginning and 338.7MB in the end (delta: 163.6MB). Free memory was 152.4MB in the beginning and 181.7MB in the end (delta: -29.4MB). Peak memory consumption was 134.2MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,485 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 175.1MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:14:27,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.32ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 140.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 175.1MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,486 INFO L158 Benchmark]: Boogie Preprocessor took 23.58ms. Allocated memory is still 175.1MB. Free memory was 138.7MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,486 INFO L158 Benchmark]: RCFGBuilder took 383.24ms. Allocated memory is still 175.1MB. Free memory was 137.2MB in the beginning and 121.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,486 INFO L158 Benchmark]: TraceAbstraction took 878205.33ms. Allocated memory was 175.1MB in the beginning and 338.7MB in the end (delta: 163.6MB). Free memory was 120.9MB in the beginning and 181.7MB in the end (delta: -60.8MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2022-12-06 05:14:27,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-06 05:14:27,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 175.1MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.32ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 140.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 175.1MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.58ms. Allocated memory is still 175.1MB. Free memory was 138.7MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 383.24ms. Allocated memory is still 175.1MB. Free memory was 137.2MB in the beginning and 121.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 878205.33ms. Allocated memory was 175.1MB in the beginning and 338.7MB in the end (delta: 163.6MB). Free memory was 120.9MB in the beginning and 181.7MB in the end (delta: -60.8MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 117 PlacesBefore, 34 PlacesAfterwards, 114 TransitionsBefore, 25 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 41 ConcurrentYvCompositions, 6 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1129, independent: 1129, independent conditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1129, unknown conditional: 0, unknown unconditional: 1129] , Statistics on independence cache: Total cache size (in pairs): 1913, Positive cache size: 1913, Positive conditional cache size: 0, Positive unconditional cache size: 1913, 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, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 262 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, 36 PlacesBefore, 36 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 388 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, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 436 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, 45 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 456 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, 50 PlacesBefore, 49 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 9, Positive cache size: 9, Positive conditional cache size: 9, 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, 54 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 602 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): 9, Positive cache size: 9, Positive conditional cache size: 9, 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, 61 PlacesBefore, 61 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 706 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): 9, Positive cache size: 9, Positive conditional cache size: 9, 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, 66 PlacesBefore, 66 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 30, 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.1s, 75 PlacesBefore, 75 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 1060 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 18, independent: 9, independent conditional: 9, 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): 39, Positive cache size: 39, Positive conditional cache size: 39, 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.1s, 91 PlacesBefore, 91 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 1702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 28, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 79, 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.8s, 126 PlacesBefore, 126 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 62, independent: 62, independent conditional: 62, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 62, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 144, Positive conditional cache size: 144, 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 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: 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: 94]: 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: 97]: 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: 96]: 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, 157 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: 878.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 679.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 141 mSolverCounterUnknown, 965 SdHoareTripleChecker+Valid, 393.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 965 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 390.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3134 IncrementalHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 0 mSDtfsCounter, 3134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 306 SyntacticMatches, 16 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 354.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3575occurred in iteration=12, InterpolantAutomatonStates: 83, 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, 15.8s SatisfiabilityAnalysisTime, 106.5s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 19633 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 3/34 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