/usr/bin/java -Xmx16000000000 -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-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:13:41,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:13:41,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:13:41,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:13:41,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:13:41,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:13:41,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:13:41,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:13:41,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:13:41,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:13:41,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:13:41,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:13:41,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:13:41,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:13:41,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:13:41,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:13:41,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:13:41,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:13:41,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:13:41,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:13:41,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:13:41,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:13:41,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:13:41,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:13:41,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:13:41,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:13:41,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:13:41,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:13:41,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:13:41,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:13:41,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:13:41,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:13:41,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:13:41,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:13:41,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:13:41,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:13:41,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:13:41,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:13:41,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:13:41,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:13:41,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:13:41,178 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-NoLbe-Before.epf [2022-01-19 04:13:41,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:13:41,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:13:41,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:13:41,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:13:41,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:13:41,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:13:41,211 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:13:41,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:13:41,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:13:41,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:13:41,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:13:41,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:13:41,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:13:41,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:13:41,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:13:41,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:13:41,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:13:41,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:13:41,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:13:41,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:13:41,215 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:13:41,215 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-01-19 04:13:41,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:13:41,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:13:41,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:13:41,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:13:41,465 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:13:41,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2022-01-19 04:13:41,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e0083d/2a04ad8aae0e4c9a83f779b3cab841da/FLAG05251dc19 [2022-01-19 04:13:41,916 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:13:41,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2022-01-19 04:13:41,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e0083d/2a04ad8aae0e4c9a83f779b3cab841da/FLAG05251dc19 [2022-01-19 04:13:41,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3e0083d/2a04ad8aae0e4c9a83f779b3cab841da [2022-01-19 04:13:41,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:13:41,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:13:41,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:13:41,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:13:41,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:13:41,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:13:41" (1/1) ... [2022-01-19 04:13:41,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cef5b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:41, skipping insertion in model container [2022-01-19 04:13:41,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:13:41" (1/1) ... [2022-01-19 04:13:41,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:13:42,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:13:42,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30697,30710] [2022-01-19 04:13:42,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30970,30983] [2022-01-19 04:13:42,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31233,31246] [2022-01-19 04:13:42,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:13:42,263 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:13:42,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30697,30710] [2022-01-19 04:13:42,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30970,30983] [2022-01-19 04:13:42,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31233,31246] [2022-01-19 04:13:42,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:13:42,369 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:13:42,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42 WrapperNode [2022-01-19 04:13:42,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:13:42,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:13:42,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:13:42,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:13:42,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,430 INFO L137 Inliner]: procedures = 176, calls = 34, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 141 [2022-01-19 04:13:42,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:13:42,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:13:42,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:13:42,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:13:42,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:13:42,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:13:42,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:13:42,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:13:42,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (1/1) ... [2022-01-19 04:13:42,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:13:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:13:42,512 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-01-19 04:13:42,543 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-01-19 04:13:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 04:13:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-19 04:13:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-19 04:13:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:13:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:13:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:13:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:13:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:13:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:13:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:13:42,561 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:13:42,704 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:13:42,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:13:42,907 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:13:43,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:13:43,008 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 04:13:43,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:13:43 BoogieIcfgContainer [2022-01-19 04:13:43,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:13:43,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:13:43,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:13:43,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:13:43,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:13:41" (1/3) ... [2022-01-19 04:13:43,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f990de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:13:43, skipping insertion in model container [2022-01-19 04:13:43,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:13:42" (2/3) ... [2022-01-19 04:13:43,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f990de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:13:43, skipping insertion in model container [2022-01-19 04:13:43,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:13:43" (3/3) ... [2022-01-19 04:13:43,043 INFO L111 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2022-01-19 04:13:43,047 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:13:43,047 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 04:13:43,047 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:13:43,080 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,080 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,081 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,082 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,082 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,082 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,082 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,083 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,084 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,084 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,084 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,084 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,084 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,085 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,086 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,087 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,088 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,088 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,088 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,088 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,088 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,089 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,090 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,090 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,090 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,090 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,090 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,091 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,092 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,093 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,094 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,095 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,096 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,097 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,097 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,097 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,097 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,098 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,098 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,098 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,099 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,100 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,100 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,100 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,100 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,100 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,118 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,121 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,121 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,122 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,123 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,124 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:43,135 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:13:43,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:13:43,197 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:13:43,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:13:43,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:43,270 INFO L129 PetriNetUnfolder]: 14/140 cut-off events. [2022-01-19 04:13:43,270 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:13:43,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 14/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2022-01-19 04:13:43,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:43,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:43,303 INFO L129 PetriNetUnfolder]: 5/86 cut-off events. [2022-01-19 04:13:43,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:13:43,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:43,306 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:43,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 04:13:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 998355330, now seen corresponding path program 1 times [2022-01-19 04:13:43,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:43,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810844566] [2022-01-19 04:13:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:43,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:43,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810844566] [2022-01-19 04:13:43,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810844566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:43,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:43,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:13:43,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542445483] [2022-01-19 04:13:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:43,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:13:43,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:13:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:13:43,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2022-01-19 04:13:43,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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-01-19 04:13:43,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:43,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2022-01-19 04:13:43,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:43,771 INFO L129 PetriNetUnfolder]: 21/219 cut-off events. [2022-01-19 04:13:43,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:13:43,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 219 events. 21/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 580 event pairs, 5 based on Foata normal form. 26/231 useless extension candidates. Maximal degree in co-relation 241. Up to 23 conditions per place. [2022-01-19 04:13:43,774 INFO L132 encePairwiseOnDemand]: 112/129 looper letters, 23 selfloop transitions, 8 changer transitions 2/121 dead transitions. [2022-01-19 04:13:43,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 313 flow [2022-01-19 04:13:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:13:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:13:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2022-01-19 04:13:43,790 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7895902547065338 [2022-01-19 04:13:43,791 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2022-01-19 04:13:43,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2022-01-19 04:13:43,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:43,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2022-01-19 04:13:43,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 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-01-19 04:13:43,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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-01-19 04:13:43,807 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 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-01-19 04:13:43,808 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 263 flow. Second operand 7 states and 713 transitions. [2022-01-19 04:13:43,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 313 flow [2022-01-19 04:13:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 121 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:13:43,814 INFO L242 Difference]: Finished difference. Result has 118 places, 115 transitions, 270 flow [2022-01-19 04:13:43,816 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2022-01-19 04:13:43,818 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2022-01-19 04:13:43,818 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 270 flow [2022-01-19 04:13:43,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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-01-19 04:13:43,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:43,819 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:43,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:13:43,820 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 04:13:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1210814051, now seen corresponding path program 1 times [2022-01-19 04:13:43,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252041731] [2022-01-19 04:13:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:43,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:44,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:44,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252041731] [2022-01-19 04:13:44,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252041731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:44,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:44,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:13:44,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773035574] [2022-01-19 04:13:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:44,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:13:44,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:13:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:13:44,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 129 [2022-01-19 04:13:44,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 270 flow. Second operand has 11 states, 11 states have (on average 85.18181818181819) internal successors, (937), 11 states have internal predecessors, (937), 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-01-19 04:13:44,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:44,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 129 [2022-01-19 04:13:44,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:44,311 INFO L129 PetriNetUnfolder]: 18/221 cut-off events. [2022-01-19 04:13:44,311 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-01-19 04:13:44,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 221 events. 18/221 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 553 event pairs, 6 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 311. Up to 19 conditions per place. [2022-01-19 04:13:44,316 INFO L132 encePairwiseOnDemand]: 115/129 looper letters, 15 selfloop transitions, 7 changer transitions 19/115 dead transitions. [2022-01-19 04:13:44,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 115 transitions, 347 flow [2022-01-19 04:13:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:13:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:13:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2022-01-19 04:13:44,321 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6642814549791294 [2022-01-19 04:13:44,321 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1114 transitions. [2022-01-19 04:13:44,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1114 transitions. [2022-01-19 04:13:44,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:44,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1114 transitions. [2022-01-19 04:13:44,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 85.6923076923077) internal successors, (1114), 13 states have internal predecessors, (1114), 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-01-19 04:13:44,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-01-19 04:13:44,330 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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-01-19 04:13:44,330 INFO L186 Difference]: Start difference. First operand has 118 places, 115 transitions, 270 flow. Second operand 13 states and 1114 transitions. [2022-01-19 04:13:44,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 115 transitions, 347 flow [2022-01-19 04:13:44,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 115 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:13:44,336 INFO L242 Difference]: Finished difference. Result has 124 places, 94 transitions, 209 flow [2022-01-19 04:13:44,336 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=209, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2022-01-19 04:13:44,337 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 5 predicate places. [2022-01-19 04:13:44,337 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 209 flow [2022-01-19 04:13:44,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.18181818181819) internal successors, (937), 11 states have internal predecessors, (937), 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-01-19 04:13:44,338 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:44,338 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:44,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:13:44,339 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 04:13:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1822550745, now seen corresponding path program 1 times [2022-01-19 04:13:44,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:44,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254039467] [2022-01-19 04:13:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:44,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:44,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:44,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254039467] [2022-01-19 04:13:44,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254039467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:44,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:44,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:13:44,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364112978] [2022-01-19 04:13:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:44,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:13:44,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:13:44,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:13:44,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 129 [2022-01-19 04:13:44,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-19 04:13:44,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:44,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 129 [2022-01-19 04:13:44,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:44,440 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2022-01-19 04:13:44,440 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:13:44,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 0/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-01-19 04:13:44,441 INFO L132 encePairwiseOnDemand]: 126/129 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2022-01-19 04:13:44,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 89 flow [2022-01-19 04:13:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 04:13:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 04:13:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2022-01-19 04:13:44,443 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8023255813953488 [2022-01-19 04:13:44,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2022-01-19 04:13:44,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2022-01-19 04:13:44,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:44,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2022-01-19 04:13:44,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-01-19 04:13:44,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 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-01-19 04:13:44,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 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-01-19 04:13:44,447 INFO L186 Difference]: Start difference. First operand has 124 places, 94 transitions, 209 flow. Second operand 4 states and 414 transitions. [2022-01-19 04:13:44,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 89 flow [2022-01-19 04:13:44,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 78 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-01-19 04:13:44,448 INFO L242 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2022-01-19 04:13:44,448 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2022-01-19 04:13:44,450 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -80 predicate places. [2022-01-19 04:13:44,450 INFO L470 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2022-01-19 04:13:44,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-01-19 04:13:44,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:13:44,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:13:44,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-01-19 04:13:44,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-19 04:13:44,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-19 04:13:44,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:13:44,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:13:44,463 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-19 04:13:44,464 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2022-01-19 04:13:44,474 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 04:13:44,475 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:13:44,475 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 04:13:44,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:44,493 INFO L129 PetriNetUnfolder]: 14/140 cut-off events. [2022-01-19 04:13:44,493 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:13:44,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 14/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2022-01-19 04:13:44,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:44,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 129 transitions, 263 flow [2022-01-19 04:13:44,504 INFO L129 PetriNetUnfolder]: 2/55 cut-off events. [2022-01-19 04:13:44,507 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:13:44,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:44,507 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:44,507 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 04:13:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1240459769, now seen corresponding path program 1 times [2022-01-19 04:13:44,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643845975] [2022-01-19 04:13:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:44,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:13:44,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:13:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:13:44,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:13:44,575 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:13:44,575 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 04:13:44,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:13:44,576 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 04:13:44,576 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 04:13:44,577 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 04:13:44,577 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 04:13:44,606 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,606 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,606 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,606 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,607 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,608 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,609 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,610 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,610 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,610 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,610 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,611 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,612 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,613 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,614 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,615 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,616 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,620 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,620 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,620 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,626 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,627 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,630 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,631 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,632 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,633 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,634 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,634 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,635 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,636 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,637 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,637 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,637 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,637 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,638 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,639 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,639 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,639 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,639 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,639 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,640 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,641 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,642 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,643 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,643 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,644 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,645 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,645 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,645 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,646 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,647 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,648 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,649 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,650 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,651 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,652 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,653 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,654 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,655 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,656 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,657 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,659 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,659 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,660 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,661 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,662 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,663 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,664 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,665 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,666 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,667 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,668 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,669 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,670 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,671 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,672 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,674 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,674 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,674 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,675 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,676 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,678 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,679 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,680 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,681 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,682 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,682 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,682 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,682 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,683 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,683 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,683 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,683 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,684 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#in~s2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic__threadmain_~myrand~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,685 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~switch10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,686 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_calculateNext_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,687 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,689 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,689 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,689 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,689 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,689 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,690 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:13:44,691 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:13:44,693 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:13:44,700 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:13:44,700 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-01-19 04:13:44,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 226 transitions, 464 flow [2022-01-19 04:13:44,749 INFO L129 PetriNetUnfolder]: 27/250 cut-off events. [2022-01-19 04:13:44,749 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:13:44,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 250 events. 27/250 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 205. Up to 6 conditions per place. [2022-01-19 04:13:44,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 226 transitions, 464 flow [2022-01-19 04:13:44,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 226 transitions, 464 flow [2022-01-19 04:13:44,765 INFO L129 PetriNetUnfolder]: 6/123 cut-off events. [2022-01-19 04:13:44,765 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:13:44,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:44,765 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:44,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash -560178494, now seen corresponding path program 1 times [2022-01-19 04:13:44,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:44,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590884778] [2022-01-19 04:13:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:44,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:44,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:44,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590884778] [2022-01-19 04:13:44,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590884778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:44,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:44,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:13:44,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262747384] [2022-01-19 04:13:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:44,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:13:44,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:13:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:13:44,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 226 [2022-01-19 04:13:44,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 226 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 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-01-19 04:13:44,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:44,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 226 [2022-01-19 04:13:44,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:45,272 INFO L129 PetriNetUnfolder]: 717/3257 cut-off events. [2022-01-19 04:13:45,272 INFO L130 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-01-19 04:13:45,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4484 conditions, 3257 events. 717/3257 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 27354 event pairs, 183 based on Foata normal form. 591/3549 useless extension candidates. Maximal degree in co-relation 2084. Up to 434 conditions per place. [2022-01-19 04:13:45,296 INFO L132 encePairwiseOnDemand]: 199/226 looper letters, 76 selfloop transitions, 12 changer transitions 0/252 dead transitions. [2022-01-19 04:13:45,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 252 transitions, 717 flow [2022-01-19 04:13:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:13:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:13:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1357 transitions. [2022-01-19 04:13:45,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8577749683944375 [2022-01-19 04:13:45,300 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1357 transitions. [2022-01-19 04:13:45,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1357 transitions. [2022-01-19 04:13:45,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:45,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1357 transitions. [2022-01-19 04:13:45,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.85714285714286) internal successors, (1357), 7 states have internal predecessors, (1357), 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-01-19 04:13:45,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:45,307 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:45,307 INFO L186 Difference]: Start difference. First operand has 206 places, 226 transitions, 464 flow. Second operand 7 states and 1357 transitions. [2022-01-19 04:13:45,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 252 transitions, 717 flow [2022-01-19 04:13:45,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 252 transitions, 715 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 04:13:45,313 INFO L242 Difference]: Finished difference. Result has 201 places, 204 transitions, 477 flow [2022-01-19 04:13:45,313 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=201, PETRI_TRANSITIONS=204} [2022-01-19 04:13:45,314 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, -5 predicate places. [2022-01-19 04:13:45,314 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 204 transitions, 477 flow [2022-01-19 04:13:45,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 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-01-19 04:13:45,314 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:45,314 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:45,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:13:45,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash -435570937, now seen corresponding path program 1 times [2022-01-19 04:13:45,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:45,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214463403] [2022-01-19 04:13:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:45,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:45,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:45,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214463403] [2022-01-19 04:13:45,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214463403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:45,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:45,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:13:45,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405682053] [2022-01-19 04:13:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:45,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:13:45,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:13:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:13:45,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 226 [2022-01-19 04:13:45,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 204 transitions, 477 flow. Second operand has 11 states, 11 states have (on average 160.1818181818182) internal successors, (1762), 11 states have internal predecessors, (1762), 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-01-19 04:13:45,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:45,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 226 [2022-01-19 04:13:45,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:46,508 INFO L129 PetriNetUnfolder]: 1157/6205 cut-off events. [2022-01-19 04:13:46,509 INFO L130 PetriNetUnfolder]: For 1718/1830 co-relation queries the response was YES. [2022-01-19 04:13:46,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 6205 events. 1157/6205 cut-off events. For 1718/1830 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 62626 event pairs, 188 based on Foata normal form. 166/5910 useless extension candidates. Maximal degree in co-relation 8201. Up to 550 conditions per place. [2022-01-19 04:13:46,563 INFO L132 encePairwiseOnDemand]: 206/226 looper letters, 150 selfloop transitions, 77 changer transitions 0/380 dead transitions. [2022-01-19 04:13:46,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 380 transitions, 1553 flow [2022-01-19 04:13:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 04:13:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 04:13:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3855 transitions. [2022-01-19 04:13:46,572 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7416313966910351 [2022-01-19 04:13:46,572 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3855 transitions. [2022-01-19 04:13:46,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3855 transitions. [2022-01-19 04:13:46,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:46,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3855 transitions. [2022-01-19 04:13:46,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 167.6086956521739) internal successors, (3855), 23 states have internal predecessors, (3855), 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-01-19 04:13:46,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 226.0) internal successors, (5424), 24 states have internal predecessors, (5424), 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-01-19 04:13:46,593 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 226.0) internal successors, (5424), 24 states have internal predecessors, (5424), 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-01-19 04:13:46,593 INFO L186 Difference]: Start difference. First operand has 201 places, 204 transitions, 477 flow. Second operand 23 states and 3855 transitions. [2022-01-19 04:13:46,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 380 transitions, 1553 flow [2022-01-19 04:13:46,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 380 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:13:46,607 INFO L242 Difference]: Finished difference. Result has 234 places, 269 transitions, 1045 flow [2022-01-19 04:13:46,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1045, PETRI_PLACES=234, PETRI_TRANSITIONS=269} [2022-01-19 04:13:46,609 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 28 predicate places. [2022-01-19 04:13:46,610 INFO L470 AbstractCegarLoop]: Abstraction has has 234 places, 269 transitions, 1045 flow [2022-01-19 04:13:46,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 160.1818181818182) internal successors, (1762), 11 states have internal predecessors, (1762), 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-01-19 04:13:46,610 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:46,611 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:46,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:13:46,611 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1919485922, now seen corresponding path program 1 times [2022-01-19 04:13:46,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:46,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368454756] [2022-01-19 04:13:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:46,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:46,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:46,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368454756] [2022-01-19 04:13:46,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368454756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:46,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:46,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:13:46,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256573647] [2022-01-19 04:13:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:46,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:13:46,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:13:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:13:46,688 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 226 [2022-01-19 04:13:46,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 269 transitions, 1045 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 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-01-19 04:13:46,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:46,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 226 [2022-01-19 04:13:46,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:47,415 INFO L129 PetriNetUnfolder]: 1134/5765 cut-off events. [2022-01-19 04:13:47,415 INFO L130 PetriNetUnfolder]: For 5625/5851 co-relation queries the response was YES. [2022-01-19 04:13:47,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11050 conditions, 5765 events. 1134/5765 cut-off events. For 5625/5851 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 57610 event pairs, 255 based on Foata normal form. 49/5377 useless extension candidates. Maximal degree in co-relation 10677. Up to 615 conditions per place. [2022-01-19 04:13:47,470 INFO L132 encePairwiseOnDemand]: 217/226 looper letters, 127 selfloop transitions, 22 changer transitions 0/346 dead transitions. [2022-01-19 04:13:47,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 346 transitions, 1781 flow [2022-01-19 04:13:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:13:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:13:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1281 transitions. [2022-01-19 04:13:47,474 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8097345132743363 [2022-01-19 04:13:47,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1281 transitions. [2022-01-19 04:13:47,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1281 transitions. [2022-01-19 04:13:47,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:47,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1281 transitions. [2022-01-19 04:13:47,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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-01-19 04:13:47,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:47,481 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:47,481 INFO L186 Difference]: Start difference. First operand has 234 places, 269 transitions, 1045 flow. Second operand 7 states and 1281 transitions. [2022-01-19 04:13:47,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 346 transitions, 1781 flow [2022-01-19 04:13:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 346 transitions, 1768 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 04:13:47,510 INFO L242 Difference]: Finished difference. Result has 239 places, 280 transitions, 1184 flow [2022-01-19 04:13:47,510 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1184, PETRI_PLACES=239, PETRI_TRANSITIONS=280} [2022-01-19 04:13:47,511 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 33 predicate places. [2022-01-19 04:13:47,511 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 280 transitions, 1184 flow [2022-01-19 04:13:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 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-01-19 04:13:47,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:47,512 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:47,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:13:47,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 6872021, now seen corresponding path program 2 times [2022-01-19 04:13:47,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:47,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651617467] [2022-01-19 04:13:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:47,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 04:13:47,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651617467] [2022-01-19 04:13:47,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651617467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:47,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:47,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:13:47,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001501314] [2022-01-19 04:13:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:47,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:13:47,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:13:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:13:47,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 226 [2022-01-19 04:13:47,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 280 transitions, 1184 flow. Second operand has 11 states, 11 states have (on average 160.27272727272728) internal successors, (1763), 11 states have internal predecessors, (1763), 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-01-19 04:13:47,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:47,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 226 [2022-01-19 04:13:47,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:48,994 INFO L129 PetriNetUnfolder]: 1393/6998 cut-off events. [2022-01-19 04:13:48,994 INFO L130 PetriNetUnfolder]: For 9403/9830 co-relation queries the response was YES. [2022-01-19 04:13:49,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14503 conditions, 6998 events. 1393/6998 cut-off events. For 9403/9830 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 72788 event pairs, 228 based on Foata normal form. 130/6673 useless extension candidates. Maximal degree in co-relation 14085. Up to 681 conditions per place. [2022-01-19 04:13:49,048 INFO L132 encePairwiseOnDemand]: 206/226 looper letters, 173 selfloop transitions, 104 changer transitions 0/451 dead transitions. [2022-01-19 04:13:49,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 451 transitions, 2670 flow [2022-01-19 04:13:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 04:13:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 04:13:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3839 transitions. [2022-01-19 04:13:49,056 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.738553289726818 [2022-01-19 04:13:49,056 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3839 transitions. [2022-01-19 04:13:49,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3839 transitions. [2022-01-19 04:13:49,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:49,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3839 transitions. [2022-01-19 04:13:49,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 166.91304347826087) internal successors, (3839), 23 states have internal predecessors, (3839), 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-01-19 04:13:49,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 226.0) internal successors, (5424), 24 states have internal predecessors, (5424), 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-01-19 04:13:49,075 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 226.0) internal successors, (5424), 24 states have internal predecessors, (5424), 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-01-19 04:13:49,075 INFO L186 Difference]: Start difference. First operand has 239 places, 280 transitions, 1184 flow. Second operand 23 states and 3839 transitions. [2022-01-19 04:13:49,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 451 transitions, 2670 flow [2022-01-19 04:13:49,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 451 transitions, 2661 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:13:49,106 INFO L242 Difference]: Finished difference. Result has 268 places, 333 transitions, 1838 flow [2022-01-19 04:13:49,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1838, PETRI_PLACES=268, PETRI_TRANSITIONS=333} [2022-01-19 04:13:49,107 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 62 predicate places. [2022-01-19 04:13:49,107 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 333 transitions, 1838 flow [2022-01-19 04:13:49,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 160.27272727272728) internal successors, (1763), 11 states have internal predecessors, (1763), 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-01-19 04:13:49,108 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:49,108 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:49,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:13:49,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 594730972, now seen corresponding path program 1 times [2022-01-19 04:13:49,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:49,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575169775] [2022-01-19 04:13:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:49,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:49,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:49,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575169775] [2022-01-19 04:13:49,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575169775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:49,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:49,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:13:49,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817734308] [2022-01-19 04:13:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:49,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:13:49,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:13:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:13:49,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 226 [2022-01-19 04:13:49,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 333 transitions, 1838 flow. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-01-19 04:13:49,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:49,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 226 [2022-01-19 04:13:49,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:49,642 INFO L129 PetriNetUnfolder]: 650/4055 cut-off events. [2022-01-19 04:13:49,642 INFO L130 PetriNetUnfolder]: For 7621/8983 co-relation queries the response was YES. [2022-01-19 04:13:49,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 4055 events. 650/4055 cut-off events. For 7621/8983 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 38015 event pairs, 108 based on Foata normal form. 52/3750 useless extension candidates. Maximal degree in co-relation 8621. Up to 360 conditions per place. [2022-01-19 04:13:49,681 INFO L132 encePairwiseOnDemand]: 218/226 looper letters, 85 selfloop transitions, 12 changer transitions 0/363 dead transitions. [2022-01-19 04:13:49,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 363 transitions, 2168 flow [2022-01-19 04:13:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:13:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:13:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 951 transitions. [2022-01-19 04:13:49,684 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8415929203539823 [2022-01-19 04:13:49,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 951 transitions. [2022-01-19 04:13:49,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 951 transitions. [2022-01-19 04:13:49,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:49,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 951 transitions. [2022-01-19 04:13:49,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 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-01-19 04:13:49,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:49,689 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:49,689 INFO L186 Difference]: Start difference. First operand has 268 places, 333 transitions, 1838 flow. Second operand 5 states and 951 transitions. [2022-01-19 04:13:49,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 363 transitions, 2168 flow [2022-01-19 04:13:49,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 363 transitions, 2113 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-01-19 04:13:49,722 INFO L242 Difference]: Finished difference. Result has 270 places, 337 transitions, 1806 flow [2022-01-19 04:13:49,722 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1806, PETRI_PLACES=270, PETRI_TRANSITIONS=337} [2022-01-19 04:13:49,723 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 64 predicate places. [2022-01-19 04:13:49,723 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 337 transitions, 1806 flow [2022-01-19 04:13:49,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-01-19 04:13:49,723 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:49,723 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:49,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:13:49,724 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash 820225134, now seen corresponding path program 2 times [2022-01-19 04:13:49,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096824214] [2022-01-19 04:13:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:49,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:49,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:49,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096824214] [2022-01-19 04:13:49,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096824214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:49,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:49,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:13:49,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645659448] [2022-01-19 04:13:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:49,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:13:49,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:13:49,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:13:49,819 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 226 [2022-01-19 04:13:49,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 337 transitions, 1806 flow. Second operand has 6 states, 6 states have (on average 174.16666666666666) internal successors, (1045), 6 states have internal predecessors, (1045), 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-01-19 04:13:49,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:49,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 226 [2022-01-19 04:13:49,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:50,663 INFO L129 PetriNetUnfolder]: 1187/6367 cut-off events. [2022-01-19 04:13:50,663 INFO L130 PetriNetUnfolder]: For 10689/11427 co-relation queries the response was YES. [2022-01-19 04:13:50,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14272 conditions, 6367 events. 1187/6367 cut-off events. For 10689/11427 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 65285 event pairs, 347 based on Foata normal form. 71/6028 useless extension candidates. Maximal degree in co-relation 13937. Up to 978 conditions per place. [2022-01-19 04:13:50,729 INFO L132 encePairwiseOnDemand]: 217/226 looper letters, 149 selfloop transitions, 28 changer transitions 3/395 dead transitions. [2022-01-19 04:13:50,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 395 transitions, 2571 flow [2022-01-19 04:13:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:13:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:13:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1275 transitions. [2022-01-19 04:13:50,733 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8059418457648546 [2022-01-19 04:13:50,733 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1275 transitions. [2022-01-19 04:13:50,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1275 transitions. [2022-01-19 04:13:50,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:50,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1275 transitions. [2022-01-19 04:13:50,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.14285714285714) internal successors, (1275), 7 states have internal predecessors, (1275), 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-01-19 04:13:50,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:50,741 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:50,741 INFO L186 Difference]: Start difference. First operand has 270 places, 337 transitions, 1806 flow. Second operand 7 states and 1275 transitions. [2022-01-19 04:13:50,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 395 transitions, 2571 flow [2022-01-19 04:13:50,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 395 transitions, 2567 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-01-19 04:13:50,784 INFO L242 Difference]: Finished difference. Result has 279 places, 341 transitions, 1920 flow [2022-01-19 04:13:50,784 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1920, PETRI_PLACES=279, PETRI_TRANSITIONS=341} [2022-01-19 04:13:50,786 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 73 predicate places. [2022-01-19 04:13:50,786 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 341 transitions, 1920 flow [2022-01-19 04:13:50,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.16666666666666) internal successors, (1045), 6 states have internal predecessors, (1045), 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-01-19 04:13:50,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:50,786 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:50,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:13:50,786 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -129186346, now seen corresponding path program 1 times [2022-01-19 04:13:50,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018023251] [2022-01-19 04:13:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:50,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:50,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018023251] [2022-01-19 04:13:50,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018023251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:50,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:50,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:13:50,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055681342] [2022-01-19 04:13:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:50,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:13:50,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:13:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:13:50,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 226 [2022-01-19 04:13:50,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 341 transitions, 1920 flow. Second operand has 6 states, 6 states have (on average 174.16666666666666) internal successors, (1045), 6 states have internal predecessors, (1045), 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-01-19 04:13:50,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:50,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 226 [2022-01-19 04:13:50,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:51,683 INFO L129 PetriNetUnfolder]: 1186/6325 cut-off events. [2022-01-19 04:13:51,683 INFO L130 PetriNetUnfolder]: For 11815/12495 co-relation queries the response was YES. [2022-01-19 04:13:51,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14369 conditions, 6325 events. 1186/6325 cut-off events. For 11815/12495 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 64564 event pairs, 276 based on Foata normal form. 55/5951 useless extension candidates. Maximal degree in co-relation 14216. Up to 696 conditions per place. [2022-01-19 04:13:51,745 INFO L132 encePairwiseOnDemand]: 217/226 looper letters, 161 selfloop transitions, 28 changer transitions 17/420 dead transitions. [2022-01-19 04:13:51,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 420 transitions, 2921 flow [2022-01-19 04:13:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:13:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:13:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1282 transitions. [2022-01-19 04:13:51,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8103666245259166 [2022-01-19 04:13:51,821 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1282 transitions. [2022-01-19 04:13:51,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1282 transitions. [2022-01-19 04:13:51,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:51,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1282 transitions. [2022-01-19 04:13:51,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.14285714285714) internal successors, (1282), 7 states have internal predecessors, (1282), 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-01-19 04:13:51,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:51,843 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-01-19 04:13:51,843 INFO L186 Difference]: Start difference. First operand has 279 places, 341 transitions, 1920 flow. Second operand 7 states and 1282 transitions. [2022-01-19 04:13:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 420 transitions, 2921 flow [2022-01-19 04:13:51,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 420 transitions, 2864 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-01-19 04:13:51,949 INFO L242 Difference]: Finished difference. Result has 285 places, 343 transitions, 1940 flow [2022-01-19 04:13:51,950 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1940, PETRI_PLACES=285, PETRI_TRANSITIONS=343} [2022-01-19 04:13:51,951 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 79 predicate places. [2022-01-19 04:13:51,951 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 343 transitions, 1940 flow [2022-01-19 04:13:51,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.16666666666666) internal successors, (1045), 6 states have internal predecessors, (1045), 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-01-19 04:13:51,951 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:51,952 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:51,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:13:51,952 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1936572067, now seen corresponding path program 3 times [2022-01-19 04:13:51,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:51,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981649151] [2022-01-19 04:13:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:51,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:13:51,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:51,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981649151] [2022-01-19 04:13:51,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981649151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:51,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:51,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 04:13:51,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414028504] [2022-01-19 04:13:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:51,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:13:51,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:13:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:13:51,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 226 [2022-01-19 04:13:51,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 343 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-01-19 04:13:51,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:51,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 226 [2022-01-19 04:13:51,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:52,282 INFO L129 PetriNetUnfolder]: 273/2353 cut-off events. [2022-01-19 04:13:52,282 INFO L130 PetriNetUnfolder]: For 3956/4493 co-relation queries the response was YES. [2022-01-19 04:13:52,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 2353 events. 273/2353 cut-off events. For 3956/4493 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 19782 event pairs, 29 based on Foata normal form. 26/2212 useless extension candidates. Maximal degree in co-relation 4690. Up to 136 conditions per place. [2022-01-19 04:13:52,305 INFO L132 encePairwiseOnDemand]: 220/226 looper letters, 20 selfloop transitions, 24 changer transitions 0/314 dead transitions. [2022-01-19 04:13:52,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 314 transitions, 1714 flow [2022-01-19 04:13:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:13:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:13:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2022-01-19 04:13:52,307 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8687315634218289 [2022-01-19 04:13:52,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 589 transitions. [2022-01-19 04:13:52,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions. [2022-01-19 04:13:52,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:52,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions. [2022-01-19 04:13:52,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 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-01-19 04:13:52,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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-01-19 04:13:52,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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-01-19 04:13:52,311 INFO L186 Difference]: Start difference. First operand has 285 places, 343 transitions, 1940 flow. Second operand 3 states and 589 transitions. [2022-01-19 04:13:52,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 314 transitions, 1714 flow [2022-01-19 04:13:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 314 transitions, 1649 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-01-19 04:13:52,334 INFO L242 Difference]: Finished difference. Result has 274 places, 311 transitions, 1578 flow [2022-01-19 04:13:52,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=274, PETRI_TRANSITIONS=311} [2022-01-19 04:13:52,334 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 68 predicate places. [2022-01-19 04:13:52,335 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 311 transitions, 1578 flow [2022-01-19 04:13:52,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-01-19 04:13:52,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:52,335 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:52,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:13:52,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 462157427, now seen corresponding path program 2 times [2022-01-19 04:13:52,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:52,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253180753] [2022-01-19 04:13:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:52,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:52,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:52,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253180753] [2022-01-19 04:13:52,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253180753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:52,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:52,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:13:52,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480823970] [2022-01-19 04:13:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:52,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:13:52,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:13:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:13:52,365 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 226 [2022-01-19 04:13:52,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 311 transitions, 1578 flow. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-01-19 04:13:52,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:52,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 226 [2022-01-19 04:13:52,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:52,676 INFO L129 PetriNetUnfolder]: 313/2435 cut-off events. [2022-01-19 04:13:52,677 INFO L130 PetriNetUnfolder]: For 4209/5207 co-relation queries the response was YES. [2022-01-19 04:13:52,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 2435 events. 313/2435 cut-off events. For 4209/5207 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 20580 event pairs, 59 based on Foata normal form. 34/2253 useless extension candidates. Maximal degree in co-relation 4923. Up to 181 conditions per place. [2022-01-19 04:13:52,697 INFO L132 encePairwiseOnDemand]: 218/226 looper letters, 59 selfloop transitions, 10 changer transitions 0/314 dead transitions. [2022-01-19 04:13:52,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 314 transitions, 1689 flow [2022-01-19 04:13:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:13:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:13:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2022-01-19 04:13:52,699 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8336283185840708 [2022-01-19 04:13:52,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2022-01-19 04:13:52,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2022-01-19 04:13:52,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:52,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2022-01-19 04:13:52,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 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-01-19 04:13:52,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:52,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:52,703 INFO L186 Difference]: Start difference. First operand has 274 places, 311 transitions, 1578 flow. Second operand 5 states and 942 transitions. [2022-01-19 04:13:52,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 314 transitions, 1689 flow [2022-01-19 04:13:52,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 314 transitions, 1627 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-01-19 04:13:52,720 INFO L242 Difference]: Finished difference. Result has 273 places, 303 transitions, 1451 flow [2022-01-19 04:13:52,720 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1451, PETRI_PLACES=273, PETRI_TRANSITIONS=303} [2022-01-19 04:13:52,721 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 67 predicate places. [2022-01-19 04:13:52,721 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 303 transitions, 1451 flow [2022-01-19 04:13:52,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-01-19 04:13:52,721 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:52,721 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:52,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:13:52,721 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1909550809, now seen corresponding path program 1 times [2022-01-19 04:13:52,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:52,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125759968] [2022-01-19 04:13:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:52,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:13:52,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125759968] [2022-01-19 04:13:52,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125759968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:52,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:52,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:13:52,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291249018] [2022-01-19 04:13:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:52,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:13:52,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:13:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:13:52,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 226 [2022-01-19 04:13:52,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 303 transitions, 1451 flow. Second operand has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 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-01-19 04:13:52,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:52,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 226 [2022-01-19 04:13:52,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:52,984 INFO L129 PetriNetUnfolder]: 201/1659 cut-off events. [2022-01-19 04:13:52,984 INFO L130 PetriNetUnfolder]: For 2467/2934 co-relation queries the response was YES. [2022-01-19 04:13:52,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1659 events. 201/1659 cut-off events. For 2467/2934 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12360 event pairs, 14 based on Foata normal form. 33/1576 useless extension candidates. Maximal degree in co-relation 3334. Up to 128 conditions per place. [2022-01-19 04:13:53,001 INFO L132 encePairwiseOnDemand]: 219/226 looper letters, 46 selfloop transitions, 6 changer transitions 2/280 dead transitions. [2022-01-19 04:13:53,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 280 transitions, 1402 flow [2022-01-19 04:13:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:13:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:13:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 934 transitions. [2022-01-19 04:13:53,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8265486725663717 [2022-01-19 04:13:53,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 934 transitions. [2022-01-19 04:13:53,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 934 transitions. [2022-01-19 04:13:53,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:53,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 934 transitions. [2022-01-19 04:13:53,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 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-01-19 04:13:53,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:53,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:53,008 INFO L186 Difference]: Start difference. First operand has 273 places, 303 transitions, 1451 flow. Second operand 5 states and 934 transitions. [2022-01-19 04:13:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 280 transitions, 1402 flow [2022-01-19 04:13:53,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 280 transitions, 1380 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 04:13:53,021 INFO L242 Difference]: Finished difference. Result has 266 places, 272 transitions, 1221 flow [2022-01-19 04:13:53,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1221, PETRI_PLACES=266, PETRI_TRANSITIONS=272} [2022-01-19 04:13:53,022 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 60 predicate places. [2022-01-19 04:13:53,022 INFO L470 AbstractCegarLoop]: Abstraction has has 266 places, 272 transitions, 1221 flow [2022-01-19 04:13:53,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 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-01-19 04:13:53,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:53,023 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:53,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 04:13:53,023 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1890573109, now seen corresponding path program 1 times [2022-01-19 04:13:53,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:53,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215209968] [2022-01-19 04:13:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:53,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:53,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:53,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215209968] [2022-01-19 04:13:53,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215209968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:53,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:53,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:13:53,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009166622] [2022-01-19 04:13:53,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:53,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:13:53,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:53,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:13:53,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:13:53,068 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 226 [2022-01-19 04:13:53,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 272 transitions, 1221 flow. Second operand has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 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-01-19 04:13:53,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:53,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 226 [2022-01-19 04:13:53,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:53,222 INFO L129 PetriNetUnfolder]: 154/1263 cut-off events. [2022-01-19 04:13:53,222 INFO L130 PetriNetUnfolder]: For 1752/1915 co-relation queries the response was YES. [2022-01-19 04:13:53,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1263 events. 154/1263 cut-off events. For 1752/1915 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8112 event pairs, 17 based on Foata normal form. 15/1198 useless extension candidates. Maximal degree in co-relation 2528. Up to 90 conditions per place. [2022-01-19 04:13:53,234 INFO L132 encePairwiseOnDemand]: 219/226 looper letters, 34 selfloop transitions, 6 changer transitions 0/250 dead transitions. [2022-01-19 04:13:53,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 250 transitions, 1137 flow [2022-01-19 04:13:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 04:13:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 04:13:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 929 transitions. [2022-01-19 04:13:53,236 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8221238938053097 [2022-01-19 04:13:53,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 929 transitions. [2022-01-19 04:13:53,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 929 transitions. [2022-01-19 04:13:53,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:53,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 929 transitions. [2022-01-19 04:13:53,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 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-01-19 04:13:53,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:53,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-01-19 04:13:53,239 INFO L186 Difference]: Start difference. First operand has 266 places, 272 transitions, 1221 flow. Second operand 5 states and 929 transitions. [2022-01-19 04:13:53,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 250 transitions, 1137 flow [2022-01-19 04:13:53,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 250 transitions, 1069 flow, removed 5 selfloop flow, removed 14 redundant places. [2022-01-19 04:13:53,249 INFO L242 Difference]: Finished difference. Result has 252 places, 249 transitions, 994 flow [2022-01-19 04:13:53,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=994, PETRI_PLACES=252, PETRI_TRANSITIONS=249} [2022-01-19 04:13:53,250 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 46 predicate places. [2022-01-19 04:13:53,250 INFO L470 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 994 flow [2022-01-19 04:13:53,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 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-01-19 04:13:53,250 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:53,251 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:53,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 04:13:53,251 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1423370047, now seen corresponding path program 1 times [2022-01-19 04:13:53,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:53,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199526663] [2022-01-19 04:13:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:53,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:53,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:53,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199526663] [2022-01-19 04:13:53,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199526663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:53,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:53,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:13:53,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371567245] [2022-01-19 04:13:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:53,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:13:53,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:13:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:13:53,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 226 [2022-01-19 04:13:53,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 249 transitions, 994 flow. Second operand has 8 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 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-01-19 04:13:53,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:53,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 226 [2022-01-19 04:13:53,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:53,571 INFO L129 PetriNetUnfolder]: 156/1286 cut-off events. [2022-01-19 04:13:53,571 INFO L130 PetriNetUnfolder]: For 1335/1494 co-relation queries the response was YES. [2022-01-19 04:13:53,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 1286 events. 156/1286 cut-off events. For 1335/1494 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8276 event pairs, 24 based on Foata normal form. 14/1228 useless extension candidates. Maximal degree in co-relation 2537. Up to 104 conditions per place. [2022-01-19 04:13:53,579 INFO L132 encePairwiseOnDemand]: 217/226 looper letters, 36 selfloop transitions, 8 changer transitions 0/248 dead transitions. [2022-01-19 04:13:53,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 248 transitions, 1080 flow [2022-01-19 04:13:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:13:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:13:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1579 transitions. [2022-01-19 04:13:53,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7763028515240905 [2022-01-19 04:13:53,581 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:53,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 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-01-19 04:13:53,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:13:53,585 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:13:53,585 INFO L186 Difference]: Start difference. First operand has 252 places, 249 transitions, 994 flow. Second operand 9 states and 1579 transitions. [2022-01-19 04:13:53,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 248 transitions, 1080 flow [2022-01-19 04:13:53,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 248 transitions, 1064 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 04:13:53,595 INFO L242 Difference]: Finished difference. Result has 256 places, 248 transitions, 996 flow [2022-01-19 04:13:53,596 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=996, PETRI_PLACES=256, PETRI_TRANSITIONS=248} [2022-01-19 04:13:53,596 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 50 predicate places. [2022-01-19 04:13:53,596 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 996 flow [2022-01-19 04:13:53,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 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-01-19 04:13:53,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:53,597 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:53,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:13:53,597 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1929429257, now seen corresponding path program 1 times [2022-01-19 04:13:53,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867547290] [2022-01-19 04:13:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:53,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:53,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:53,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867547290] [2022-01-19 04:13:53,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867547290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:53,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:53,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:13:53,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776695779] [2022-01-19 04:13:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:53,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:13:53,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:53,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:13:53,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:13:53,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 226 [2022-01-19 04:13:53,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 996 flow. Second operand has 8 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 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-01-19 04:13:53,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:53,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 226 [2022-01-19 04:13:53,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:53,888 INFO L129 PetriNetUnfolder]: 156/1268 cut-off events. [2022-01-19 04:13:53,888 INFO L130 PetriNetUnfolder]: For 1384/1543 co-relation queries the response was YES. [2022-01-19 04:13:53,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 1268 events. 156/1268 cut-off events. For 1384/1543 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8173 event pairs, 24 based on Foata normal form. 14/1230 useless extension candidates. Maximal degree in co-relation 2542. Up to 105 conditions per place. [2022-01-19 04:13:53,899 INFO L132 encePairwiseOnDemand]: 217/226 looper letters, 36 selfloop transitions, 8 changer transitions 0/247 dead transitions. [2022-01-19 04:13:53,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 247 transitions, 1082 flow [2022-01-19 04:13:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:13:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:13:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1579 transitions. [2022-01-19 04:13:53,901 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7763028515240905 [2022-01-19 04:13:53,901 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:53,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1579 transitions. [2022-01-19 04:13:53,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 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-01-19 04:13:53,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:13:53,906 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:13:53,906 INFO L186 Difference]: Start difference. First operand has 256 places, 248 transitions, 996 flow. Second operand 9 states and 1579 transitions. [2022-01-19 04:13:53,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 247 transitions, 1082 flow [2022-01-19 04:13:53,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 247 transitions, 1068 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 04:13:53,915 INFO L242 Difference]: Finished difference. Result has 256 places, 247 transitions, 1000 flow [2022-01-19 04:13:53,915 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1000, PETRI_PLACES=256, PETRI_TRANSITIONS=247} [2022-01-19 04:13:53,916 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 50 predicate places. [2022-01-19 04:13:53,916 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 247 transitions, 1000 flow [2022-01-19 04:13:53,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 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-01-19 04:13:53,916 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:53,917 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:53,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 04:13:53,917 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1856585183, now seen corresponding path program 1 times [2022-01-19 04:13:53,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982335873] [2022-01-19 04:13:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:53,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:54,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:54,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982335873] [2022-01-19 04:13:54,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982335873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:54,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:54,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 04:13:54,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619669469] [2022-01-19 04:13:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:54,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:13:54,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:13:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-19 04:13:54,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 226 [2022-01-19 04:13:54,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 247 transitions, 1000 flow. Second operand has 15 states, 15 states have (on average 142.86666666666667) internal successors, (2143), 15 states have internal predecessors, (2143), 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-01-19 04:13:54,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:54,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 226 [2022-01-19 04:13:54,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:55,618 INFO L129 PetriNetUnfolder]: 2094/5300 cut-off events. [2022-01-19 04:13:55,618 INFO L130 PetriNetUnfolder]: For 11055/11104 co-relation queries the response was YES. [2022-01-19 04:13:55,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14573 conditions, 5300 events. 2094/5300 cut-off events. For 11055/11104 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 39568 event pairs, 166 based on Foata normal form. 89/5216 useless extension candidates. Maximal degree in co-relation 14418. Up to 688 conditions per place. [2022-01-19 04:13:55,656 INFO L132 encePairwiseOnDemand]: 207/226 looper letters, 263 selfloop transitions, 242 changer transitions 4/654 dead transitions. [2022-01-19 04:13:55,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 654 transitions, 4331 flow [2022-01-19 04:13:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 04:13:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 04:13:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6387 transitions. [2022-01-19 04:13:55,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6572339987651781 [2022-01-19 04:13:55,662 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6387 transitions. [2022-01-19 04:13:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6387 transitions. [2022-01-19 04:13:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:55,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6387 transitions. [2022-01-19 04:13:55,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 148.53488372093022) internal successors, (6387), 43 states have internal predecessors, (6387), 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-01-19 04:13:55,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 226.0) internal successors, (9944), 44 states have internal predecessors, (9944), 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-01-19 04:13:55,682 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 226.0) internal successors, (9944), 44 states have internal predecessors, (9944), 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-01-19 04:13:55,682 INFO L186 Difference]: Start difference. First operand has 256 places, 247 transitions, 1000 flow. Second operand 43 states and 6387 transitions. [2022-01-19 04:13:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 654 transitions, 4331 flow [2022-01-19 04:13:55,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 654 transitions, 4317 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 04:13:55,706 INFO L242 Difference]: Finished difference. Result has 331 places, 484 transitions, 3624 flow [2022-01-19 04:13:55,706 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3624, PETRI_PLACES=331, PETRI_TRANSITIONS=484} [2022-01-19 04:13:55,707 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 125 predicate places. [2022-01-19 04:13:55,707 INFO L470 AbstractCegarLoop]: Abstraction has has 331 places, 484 transitions, 3624 flow [2022-01-19 04:13:55,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 142.86666666666667) internal successors, (2143), 15 states have internal predecessors, (2143), 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-01-19 04:13:55,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:55,708 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:55,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 04:13:55,708 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1636440279, now seen corresponding path program 1 times [2022-01-19 04:13:55,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:55,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361534050] [2022-01-19 04:13:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:55,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:55,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361534050] [2022-01-19 04:13:55,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361534050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:55,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:13:55,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 04:13:55,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564163939] [2022-01-19 04:13:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:55,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:13:55,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:13:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-19 04:13:55,891 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 226 [2022-01-19 04:13:55,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 484 transitions, 3624 flow. Second operand has 15 states, 15 states have (on average 142.86666666666667) internal successors, (2143), 15 states have internal predecessors, (2143), 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-01-19 04:13:55,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:55,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 226 [2022-01-19 04:13:55,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:13:57,573 INFO L129 PetriNetUnfolder]: 2311/6214 cut-off events. [2022-01-19 04:13:57,574 INFO L130 PetriNetUnfolder]: For 20709/20924 co-relation queries the response was YES. [2022-01-19 04:13:57,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18234 conditions, 6214 events. 2311/6214 cut-off events. For 20709/20924 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 50170 event pairs, 158 based on Foata normal form. 112/6132 useless extension candidates. Maximal degree in co-relation 17772. Up to 837 conditions per place. [2022-01-19 04:13:57,635 INFO L132 encePairwiseOnDemand]: 207/226 looper letters, 348 selfloop transitions, 226 changer transitions 4/869 dead transitions. [2022-01-19 04:13:57,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 869 transitions, 6913 flow [2022-01-19 04:13:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 04:13:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 04:13:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6386 transitions. [2022-01-19 04:13:57,641 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6571310969335254 [2022-01-19 04:13:57,641 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6386 transitions. [2022-01-19 04:13:57,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6386 transitions. [2022-01-19 04:13:57,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:13:57,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6386 transitions. [2022-01-19 04:13:57,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 148.51162790697674) internal successors, (6386), 43 states have internal predecessors, (6386), 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-01-19 04:13:57,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 226.0) internal successors, (9944), 44 states have internal predecessors, (9944), 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-01-19 04:13:57,663 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 226.0) internal successors, (9944), 44 states have internal predecessors, (9944), 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-01-19 04:13:57,663 INFO L186 Difference]: Start difference. First operand has 331 places, 484 transitions, 3624 flow. Second operand 43 states and 6386 transitions. [2022-01-19 04:13:57,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 869 transitions, 6913 flow [2022-01-19 04:13:57,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 869 transitions, 6587 flow, removed 161 selfloop flow, removed 2 redundant places. [2022-01-19 04:13:57,752 INFO L242 Difference]: Finished difference. Result has 411 places, 701 transitions, 5698 flow [2022-01-19 04:13:57,752 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=3298, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=5698, PETRI_PLACES=411, PETRI_TRANSITIONS=701} [2022-01-19 04:13:57,752 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 205 predicate places. [2022-01-19 04:13:57,753 INFO L470 AbstractCegarLoop]: Abstraction has has 411 places, 701 transitions, 5698 flow [2022-01-19 04:13:57,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 142.86666666666667) internal successors, (2143), 15 states have internal predecessors, (2143), 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-01-19 04:13:57,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:13:57,754 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:13:57,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 04:13:57,754 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:13:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:13:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1151806226, now seen corresponding path program 2 times [2022-01-19 04:13:57,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:13:57,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909358036] [2022-01-19 04:13:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:13:57,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:13:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:13:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:13:58,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:13:58,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909358036] [2022-01-19 04:13:58,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909358036] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:13:58,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446257219] [2022-01-19 04:13:58,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:13:58,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:13:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:13:58,059 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-01-19 04:13:58,075 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-01-19 04:13:58,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:13:58,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:13:58,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-19 04:13:58,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:13:58,321 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:13:58,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:13:58,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:13:58,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-19 04:13:59,379 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:13:59,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-01-19 04:13:59,479 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:13:59,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-19 04:13:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:13:59,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:13:59,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446257219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:13:59,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:13:59,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [17] total 30 [2022-01-19 04:13:59,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962433500] [2022-01-19 04:13:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:13:59,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 04:13:59,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:13:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 04:13:59,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-01-19 04:13:59,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 226 [2022-01-19 04:13:59,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 701 transitions, 5698 flow. Second operand has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:13:59,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:13:59,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 226 [2022-01-19 04:13:59,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:01,816 INFO L129 PetriNetUnfolder]: 2701/7120 cut-off events. [2022-01-19 04:14:01,816 INFO L130 PetriNetUnfolder]: For 58667/58836 co-relation queries the response was YES. [2022-01-19 04:14:01,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26645 conditions, 7120 events. 2701/7120 cut-off events. For 58667/58836 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 58928 event pairs, 196 based on Foata normal form. 28/7018 useless extension candidates. Maximal degree in co-relation 26144. Up to 1729 conditions per place. [2022-01-19 04:14:01,889 INFO L132 encePairwiseOnDemand]: 204/226 looper letters, 459 selfloop transitions, 240 changer transitions 0/988 dead transitions. [2022-01-19 04:14:01,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 988 transitions, 9350 flow [2022-01-19 04:14:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 04:14:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 04:14:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4488 transitions. [2022-01-19 04:14:01,894 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6405937767627747 [2022-01-19 04:14:01,894 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4488 transitions. [2022-01-19 04:14:01,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4488 transitions. [2022-01-19 04:14:01,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:01,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4488 transitions. [2022-01-19 04:14:01,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 144.7741935483871) internal successors, (4488), 31 states have internal predecessors, (4488), 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-01-19 04:14:01,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:01,907 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:01,907 INFO L186 Difference]: Start difference. First operand has 411 places, 701 transitions, 5698 flow. Second operand 31 states and 4488 transitions. [2022-01-19 04:14:01,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 988 transitions, 9350 flow [2022-01-19 04:14:02,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 988 transitions, 9076 flow, removed 134 selfloop flow, removed 3 redundant places. [2022-01-19 04:14:02,263 INFO L242 Difference]: Finished difference. Result has 450 places, 879 transitions, 8073 flow [2022-01-19 04:14:02,263 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=5424, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8073, PETRI_PLACES=450, PETRI_TRANSITIONS=879} [2022-01-19 04:14:02,264 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 244 predicate places. [2022-01-19 04:14:02,264 INFO L470 AbstractCegarLoop]: Abstraction has has 450 places, 879 transitions, 8073 flow [2022-01-19 04:14:02,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:14:02,264 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:02,265 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:02,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 04:14:02,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:02,479 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1062038506, now seen corresponding path program 3 times [2022-01-19 04:14:02,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:02,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365146633] [2022-01-19 04:14:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:02,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:02,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365146633] [2022-01-19 04:14:02,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365146633] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632358582] [2022-01-19 04:14:02,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:14:02,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:02,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:02,819 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-01-19 04:14:02,820 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-01-19 04:14:02,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:14:02,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:14:02,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-19 04:14:02,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:02,985 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:02,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:03,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:03,687 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:14:03,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:14:03,712 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:14:03,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:14:03,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:03,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:03,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-19 04:14:03,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:03,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:03,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-19 04:14:03,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:14:04,033 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:14:04,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:14:04,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:04,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:14:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:04,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:14:04,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632358582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:14:04,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:14:04,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 28 [2022-01-19 04:14:04,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707153141] [2022-01-19 04:14:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:14:04,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:14:04,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:14:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-01-19 04:14:04,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:14:04,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 879 transitions, 8073 flow. Second operand has 15 states, 15 states have (on average 143.86666666666667) internal successors, (2158), 15 states have internal predecessors, (2158), 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-01-19 04:14:04,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:04,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:14:04,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:05,866 INFO L129 PetriNetUnfolder]: 2891/7512 cut-off events. [2022-01-19 04:14:05,866 INFO L130 PetriNetUnfolder]: For 68459/68708 co-relation queries the response was YES. [2022-01-19 04:14:05,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30527 conditions, 7512 events. 2891/7512 cut-off events. For 68459/68708 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 61892 event pairs, 195 based on Foata normal form. 46/7419 useless extension candidates. Maximal degree in co-relation 30090. Up to 2977 conditions per place. [2022-01-19 04:14:05,961 INFO L132 encePairwiseOnDemand]: 205/226 looper letters, 517 selfloop transitions, 243 changer transitions 0/1052 dead transitions. [2022-01-19 04:14:05,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1052 transitions, 10961 flow [2022-01-19 04:14:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:14:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:14:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2279 transitions. [2022-01-19 04:14:05,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6722713864306785 [2022-01-19 04:14:05,964 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2279 transitions. [2022-01-19 04:14:05,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2279 transitions. [2022-01-19 04:14:05,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:05,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2279 transitions. [2022-01-19 04:14:05,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 151.93333333333334) internal successors, (2279), 15 states have internal predecessors, (2279), 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-01-19 04:14:05,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 226.0) internal successors, (3616), 16 states have internal predecessors, (3616), 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-01-19 04:14:05,970 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 226.0) internal successors, (3616), 16 states have internal predecessors, (3616), 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-01-19 04:14:05,970 INFO L186 Difference]: Start difference. First operand has 450 places, 879 transitions, 8073 flow. Second operand 15 states and 2279 transitions. [2022-01-19 04:14:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1052 transitions, 10961 flow [2022-01-19 04:14:06,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1052 transitions, 10745 flow, removed 91 selfloop flow, removed 5 redundant places. [2022-01-19 04:14:06,321 INFO L242 Difference]: Finished difference. Result has 471 places, 957 transitions, 9832 flow [2022-01-19 04:14:06,322 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=7953, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9832, PETRI_PLACES=471, PETRI_TRANSITIONS=957} [2022-01-19 04:14:06,322 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 265 predicate places. [2022-01-19 04:14:06,322 INFO L470 AbstractCegarLoop]: Abstraction has has 471 places, 957 transitions, 9832 flow [2022-01-19 04:14:06,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.86666666666667) internal successors, (2158), 15 states have internal predecessors, (2158), 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-01-19 04:14:06,322 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:06,322 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:06,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 04:14:06,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-19 04:14:06,524 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -44904636, now seen corresponding path program 2 times [2022-01-19 04:14:06,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:06,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025627921] [2022-01-19 04:14:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:06,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:06,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025627921] [2022-01-19 04:14:06,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025627921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371754709] [2022-01-19 04:14:06,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:14:06,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:06,820 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-01-19 04:14:06,824 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-01-19 04:14:06,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:14:06,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:14:06,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-19 04:14:06,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:06,997 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:06,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:07,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:07,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-19 04:14:07,844 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:14:07,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2022-01-19 04:14:07,905 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:14:07,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-19 04:14:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:07,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:14:07,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371754709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:14:07,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:14:07,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [17] total 30 [2022-01-19 04:14:07,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606325077] [2022-01-19 04:14:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:14:07,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 04:14:07,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 04:14:07,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-01-19 04:14:07,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 226 [2022-01-19 04:14:07,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 957 transitions, 9832 flow. Second operand has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:14:07,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:07,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 226 [2022-01-19 04:14:07,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:10,752 INFO L129 PetriNetUnfolder]: 2786/7650 cut-off events. [2022-01-19 04:14:10,752 INFO L130 PetriNetUnfolder]: For 67266/67573 co-relation queries the response was YES. [2022-01-19 04:14:10,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30531 conditions, 7650 events. 2786/7650 cut-off events. For 67266/67573 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 65554 event pairs, 188 based on Foata normal form. 81/7582 useless extension candidates. Maximal degree in co-relation 29832. Up to 1590 conditions per place. [2022-01-19 04:14:10,838 INFO L132 encePairwiseOnDemand]: 203/226 looper letters, 540 selfloop transitions, 241 changer transitions 0/1231 dead transitions. [2022-01-19 04:14:10,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 1231 transitions, 13540 flow [2022-01-19 04:14:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 04:14:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 04:14:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4485 transitions. [2022-01-19 04:14:10,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6401655723665429 [2022-01-19 04:14:10,842 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4485 transitions. [2022-01-19 04:14:10,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4485 transitions. [2022-01-19 04:14:10,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:10,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4485 transitions. [2022-01-19 04:14:10,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 144.67741935483872) internal successors, (4485), 31 states have internal predecessors, (4485), 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-01-19 04:14:10,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:10,851 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:10,852 INFO L186 Difference]: Start difference. First operand has 471 places, 957 transitions, 9832 flow. Second operand 31 states and 4485 transitions. [2022-01-19 04:14:10,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 1231 transitions, 13540 flow [2022-01-19 04:14:11,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1231 transitions, 13480 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-01-19 04:14:11,098 INFO L242 Difference]: Finished difference. Result has 511 places, 1133 transitions, 12400 flow [2022-01-19 04:14:11,099 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=9772, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=12400, PETRI_PLACES=511, PETRI_TRANSITIONS=1133} [2022-01-19 04:14:11,099 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 305 predicate places. [2022-01-19 04:14:11,099 INFO L470 AbstractCegarLoop]: Abstraction has has 511 places, 1133 transitions, 12400 flow [2022-01-19 04:14:11,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:14:11,100 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:11,100 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:11,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 04:14:11,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:11,315 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash -968744410, now seen corresponding path program 3 times [2022-01-19 04:14:11,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:11,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791760362] [2022-01-19 04:14:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:11,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:11,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:11,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791760362] [2022-01-19 04:14:11,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791760362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:11,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940372239] [2022-01-19 04:14:11,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:14:11,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:11,656 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-01-19 04:14:11,687 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-01-19 04:14:11,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:14:11,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:14:11,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-19 04:14:11,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:11,841 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:11,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:12,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:12,744 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:14:12,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2022-01-19 04:14:12,774 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:14:12,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:14:12,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:12,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:12,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2022-01-19 04:14:12,859 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:14:12,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:12,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-19 04:14:12,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:14:13,004 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:14:13,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:14:13,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:13,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:14:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:13,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:14:13,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940372239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:14:13,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:14:13,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [18] total 31 [2022-01-19 04:14:13,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105888930] [2022-01-19 04:14:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:14:13,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 04:14:13,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:13,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 04:14:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2022-01-19 04:14:13,044 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 226 [2022-01-19 04:14:13,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 1133 transitions, 12400 flow. Second operand has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:14:13,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:13,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 226 [2022-01-19 04:14:13,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:15,645 INFO L129 PetriNetUnfolder]: 2789/7651 cut-off events. [2022-01-19 04:14:15,645 INFO L130 PetriNetUnfolder]: For 76961/77268 co-relation queries the response was YES. [2022-01-19 04:14:15,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32777 conditions, 7651 events. 2789/7651 cut-off events. For 76961/77268 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 65649 event pairs, 173 based on Foata normal form. 81/7583 useless extension candidates. Maximal degree in co-relation 32066. Up to 1537 conditions per place. [2022-01-19 04:14:15,743 INFO L132 encePairwiseOnDemand]: 203/226 looper letters, 541 selfloop transitions, 247 changer transitions 0/1238 dead transitions. [2022-01-19 04:14:15,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 1238 transitions, 14666 flow [2022-01-19 04:14:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-19 04:14:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-01-19 04:14:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4906 transitions. [2022-01-19 04:14:15,747 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6384695471108798 [2022-01-19 04:14:15,747 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4906 transitions. [2022-01-19 04:14:15,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4906 transitions. [2022-01-19 04:14:15,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:15,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4906 transitions. [2022-01-19 04:14:15,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 144.2941176470588) internal successors, (4906), 34 states have internal predecessors, (4906), 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-01-19 04:14:15,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 226.0) internal successors, (7910), 35 states have internal predecessors, (7910), 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-01-19 04:14:15,758 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 226.0) internal successors, (7910), 35 states have internal predecessors, (7910), 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-01-19 04:14:15,758 INFO L186 Difference]: Start difference. First operand has 511 places, 1133 transitions, 12400 flow. Second operand 34 states and 4906 transitions. [2022-01-19 04:14:15,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 1238 transitions, 14666 flow [2022-01-19 04:14:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1238 transitions, 14520 flow, removed 56 selfloop flow, removed 5 redundant places. [2022-01-19 04:14:16,177 INFO L242 Difference]: Finished difference. Result has 541 places, 1140 transitions, 12850 flow [2022-01-19 04:14:16,178 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=12260, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=12850, PETRI_PLACES=541, PETRI_TRANSITIONS=1140} [2022-01-19 04:14:16,179 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 335 predicate places. [2022-01-19 04:14:16,179 INFO L470 AbstractCegarLoop]: Abstraction has has 541 places, 1140 transitions, 12850 flow [2022-01-19 04:14:16,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.55555555555554) internal successors, (2530), 18 states have internal predecessors, (2530), 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-01-19 04:14:16,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:16,180 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:16,198 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-01-19 04:14:16,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:16,391 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 853371001, now seen corresponding path program 1 times [2022-01-19 04:14:16,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578216379] [2022-01-19 04:14:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:16,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:14:16,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578216379] [2022-01-19 04:14:16,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578216379] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949916880] [2022-01-19 04:14:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:16,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:16,656 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-01-19 04:14:16,682 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-01-19 04:14:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:16,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-19 04:14:16,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:16,830 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:16,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:16,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:17,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 04:14:17,553 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:14:17,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:14:17,573 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:14:17,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:14:17,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:17,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:14:17,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-19 04:14:17,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:17,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:14:17,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:14:17,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:14:17,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-19 04:14:17,846 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:14:17,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-19 04:14:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:17,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:14:17,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949916880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:14:17,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:14:17,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 27 [2022-01-19 04:14:17,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189397744] [2022-01-19 04:14:17,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:14:17,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:14:17,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:14:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-01-19 04:14:17,855 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:14:17,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 1140 transitions, 12850 flow. Second operand has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:14:17,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:17,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:14:17,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:21,448 INFO L129 PetriNetUnfolder]: 4132/10688 cut-off events. [2022-01-19 04:14:21,448 INFO L130 PetriNetUnfolder]: For 178626/178971 co-relation queries the response was YES. [2022-01-19 04:14:21,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51795 conditions, 10688 events. 4132/10688 cut-off events. For 178626/178971 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 93822 event pairs, 228 based on Foata normal form. 126/10603 useless extension candidates. Maximal degree in co-relation 51349. Up to 1417 conditions per place. [2022-01-19 04:14:21,596 INFO L132 encePairwiseOnDemand]: 204/226 looper letters, 607 selfloop transitions, 628 changer transitions 0/1674 dead transitions. [2022-01-19 04:14:21,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 1674 transitions, 22348 flow [2022-01-19 04:14:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 04:14:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 04:14:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4629 transitions. [2022-01-19 04:14:21,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6607193833856694 [2022-01-19 04:14:21,600 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4629 transitions. [2022-01-19 04:14:21,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4629 transitions. [2022-01-19 04:14:21,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:21,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4629 transitions. [2022-01-19 04:14:21,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 149.32258064516128) internal successors, (4629), 31 states have internal predecessors, (4629), 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-01-19 04:14:21,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:21,610 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 226.0) internal successors, (7232), 32 states have internal predecessors, (7232), 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-01-19 04:14:21,610 INFO L186 Difference]: Start difference. First operand has 541 places, 1140 transitions, 12850 flow. Second operand 31 states and 4629 transitions. [2022-01-19 04:14:21,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 1674 transitions, 22348 flow [2022-01-19 04:14:22,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 1674 transitions, 21920 flow, removed 25 selfloop flow, removed 27 redundant places. [2022-01-19 04:14:22,314 INFO L242 Difference]: Finished difference. Result has 568 places, 1495 transitions, 20151 flow [2022-01-19 04:14:22,315 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=12428, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=20151, PETRI_PLACES=568, PETRI_TRANSITIONS=1495} [2022-01-19 04:14:22,315 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 362 predicate places. [2022-01-19 04:14:22,315 INFO L470 AbstractCegarLoop]: Abstraction has has 568 places, 1495 transitions, 20151 flow [2022-01-19 04:14:22,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:14:22,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:22,316 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:22,331 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-01-19 04:14:22,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-01-19 04:14:22,517 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:22,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -940493293, now seen corresponding path program 2 times [2022-01-19 04:14:22,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:22,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666217320] [2022-01-19 04:14:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:22,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:14:22,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666217320] [2022-01-19 04:14:22,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666217320] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808753548] [2022-01-19 04:14:22,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:14:22,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:22,763 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-01-19 04:14:22,763 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-01-19 04:14:22,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:14:22,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:14:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 04:14:22,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:22,934 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:14:22,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:14:23,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:23,508 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:23,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:23,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-19 04:14:24,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 04:14:24,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-19 04:14:24,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:14:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:14:24,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:14:24,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:24,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:24,184 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (not .cse0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_#res#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or .cse0 (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:24,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:24,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (not .cse0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or .cse0 (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:14:24,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|))) (and (or (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse0)) (or (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:14:24,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (and (forall ((v_ArrVal_473 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (forall ((v_ArrVal_473 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:14:24,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (and (forall ((v_ArrVal_473 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_~#seed~0.base|) |c_~#seed~0.offset|) (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|)) (forall ((v_ArrVal_476 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_476) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (forall ((v_ArrVal_473 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473) |c_~#seed~0.base|) |c_~#seed~0.offset|) (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|))) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_473))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:14:30,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:14:30,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2022-01-19 04:14:30,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-01-19 04:14:30,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 182 [2022-01-19 04:14:30,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 180 [2022-01-19 04:14:30,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 174 [2022-01-19 04:14:30,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 166 [2022-01-19 04:14:31,098 INFO L353 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-01-19 04:14:31,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-01-19 04:14:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2022-01-19 04:14:31,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808753548] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:14:31,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:14:31,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 20] total 48 [2022-01-19 04:14:31,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065117507] [2022-01-19 04:14:31,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:14:31,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-19 04:14:31,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-19 04:14:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1335, Unknown=10, NotChecked=664, Total=2256 [2022-01-19 04:14:31,146 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 226 [2022-01-19 04:14:31,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 1495 transitions, 20151 flow. Second operand has 48 states, 48 states have (on average 128.9375) internal successors, (6189), 48 states have internal predecessors, (6189), 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-01-19 04:14:31,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:31,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 226 [2022-01-19 04:14:31,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:14:39,704 INFO L129 PetriNetUnfolder]: 7555/19086 cut-off events. [2022-01-19 04:14:39,704 INFO L130 PetriNetUnfolder]: For 420284/420739 co-relation queries the response was YES. [2022-01-19 04:14:39,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106945 conditions, 19086 events. 7555/19086 cut-off events. For 420284/420739 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 189595 event pairs, 518 based on Foata normal form. 171/18837 useless extension candidates. Maximal degree in co-relation 106504. Up to 4277 conditions per place. [2022-01-19 04:14:40,204 INFO L132 encePairwiseOnDemand]: 199/226 looper letters, 1415 selfloop transitions, 999 changer transitions 0/2837 dead transitions. [2022-01-19 04:14:40,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 2837 transitions, 45660 flow [2022-01-19 04:14:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-19 04:14:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-01-19 04:14:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5248 transitions. [2022-01-19 04:14:40,210 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5954163830270025 [2022-01-19 04:14:40,210 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 5248 transitions. [2022-01-19 04:14:40,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 5248 transitions. [2022-01-19 04:14:40,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:14:40,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 5248 transitions. [2022-01-19 04:14:40,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 134.56410256410257) internal successors, (5248), 39 states have internal predecessors, (5248), 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-01-19 04:14:40,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 226.0) internal successors, (9040), 40 states have internal predecessors, (9040), 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-01-19 04:14:40,223 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 226.0) internal successors, (9040), 40 states have internal predecessors, (9040), 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-01-19 04:14:40,223 INFO L186 Difference]: Start difference. First operand has 568 places, 1495 transitions, 20151 flow. Second operand 39 states and 5248 transitions. [2022-01-19 04:14:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 2837 transitions, 45660 flow [2022-01-19 04:14:43,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 2837 transitions, 44190 flow, removed 733 selfloop flow, removed 2 redundant places. [2022-01-19 04:14:43,581 INFO L242 Difference]: Finished difference. Result has 621 places, 2253 transitions, 37035 flow [2022-01-19 04:14:43,582 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=19453, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=37035, PETRI_PLACES=621, PETRI_TRANSITIONS=2253} [2022-01-19 04:14:43,582 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 415 predicate places. [2022-01-19 04:14:43,582 INFO L470 AbstractCegarLoop]: Abstraction has has 621 places, 2253 transitions, 37035 flow [2022-01-19 04:14:43,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 128.9375) internal successors, (6189), 48 states have internal predecessors, (6189), 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-01-19 04:14:43,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:14:43,583 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:14:43,599 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-01-19 04:14:43,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:43,784 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:14:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:14:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1955117351, now seen corresponding path program 3 times [2022-01-19 04:14:43,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:14:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763901354] [2022-01-19 04:14:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:14:43,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:14:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:14:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:44,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:14:44,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763901354] [2022-01-19 04:14:44,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763901354] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:14:44,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382292517] [2022-01-19 04:14:44,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:14:44,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:14:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:14:44,084 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-01-19 04:14:44,084 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-01-19 04:14:44,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:14:44,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:14:44,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 04:14:44,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:14:44,241 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:14:44,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:14:44,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:14:44,581 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:14:44,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:14:44,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 04:14:44,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-19 04:14:44,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-19 04:14:45,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:14:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:14:45,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:14:45,062 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:45,091 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:14:45,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((v_ArrVal_523 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_#res#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) is different from false [2022-01-19 04:14:45,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:14:45,155 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (forall ((v_ArrVal_521 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (forall ((v_ArrVal_523 (Array Int Int))) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) is different from false [2022-01-19 04:14:45,247 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0) (and (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (forall ((v_ArrVal_521 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (forall ((v_ArrVal_523 (Array Int Int))) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|)))))))) is different from false [2022-01-19 04:14:45,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0) (and (forall ((v_ArrVal_521 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))) (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)))))) is different from false [2022-01-19 04:14:45,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0) (and (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|))))) (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) is different from false [2022-01-19 04:14:45,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0) (and (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521))) (store .cse0 |c_~#seed~0.base| (store (select .cse0 |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|))) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|))))) (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) is different from false [2022-01-19 04:14:50,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:14:50,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2022-01-19 04:14:50,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 147 [2022-01-19 04:14:50,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2022-01-19 04:14:50,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2022-01-19 04:14:50,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2022-01-19 04:14:50,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-01-19 04:14:51,559 INFO L353 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-01-19 04:14:51,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-01-19 04:14:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2022-01-19 04:14:51,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382292517] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:14:51,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:14:51,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 19] total 44 [2022-01-19 04:14:51,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710972541] [2022-01-19 04:14:51,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:14:51,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-19 04:14:51,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:14:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-19 04:14:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1050, Unknown=10, NotChecked=666, Total=1892 [2022-01-19 04:14:51,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 226 [2022-01-19 04:14:51,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 2253 transitions, 37035 flow. Second operand has 44 states, 44 states have (on average 132.0) internal successors, (5808), 44 states have internal predecessors, (5808), 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-01-19 04:14:51,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:14:51,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 226 [2022-01-19 04:14:51,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:15:10,595 INFO L129 PetriNetUnfolder]: 13051/32876 cut-off events. [2022-01-19 04:15:10,595 INFO L130 PetriNetUnfolder]: For 997122/997835 co-relation queries the response was YES. [2022-01-19 04:15:11,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208542 conditions, 32876 events. 13051/32876 cut-off events. For 997122/997835 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 351552 event pairs, 853 based on Foata normal form. 653/32794 useless extension candidates. Maximal degree in co-relation 208084. Up to 6731 conditions per place. [2022-01-19 04:15:11,521 INFO L132 encePairwiseOnDemand]: 200/226 looper letters, 1531 selfloop transitions, 2586 changer transitions 0/4543 dead transitions. [2022-01-19 04:15:11,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 4543 transitions, 86414 flow [2022-01-19 04:15:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-19 04:15:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-01-19 04:15:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 6961 transitions. [2022-01-19 04:15:11,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6039389207010237 [2022-01-19 04:15:11,528 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 6961 transitions. [2022-01-19 04:15:11,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 6961 transitions. [2022-01-19 04:15:11,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:15:11,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 6961 transitions. [2022-01-19 04:15:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 136.49019607843138) internal successors, (6961), 51 states have internal predecessors, (6961), 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-01-19 04:15:11,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 226.0) internal successors, (11752), 52 states have internal predecessors, (11752), 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-01-19 04:15:11,544 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 226.0) internal successors, (11752), 52 states have internal predecessors, (11752), 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-01-19 04:15:11,544 INFO L186 Difference]: Start difference. First operand has 621 places, 2253 transitions, 37035 flow. Second operand 51 states and 6961 transitions. [2022-01-19 04:15:11,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 4543 transitions, 86414 flow [2022-01-19 04:15:19,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 4543 transitions, 85783 flow, removed 194 selfloop flow, removed 15 redundant places. [2022-01-19 04:15:19,513 INFO L242 Difference]: Finished difference. Result has 699 places, 4001 transitions, 81329 flow [2022-01-19 04:15:19,515 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=36726, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=994, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=81329, PETRI_PLACES=699, PETRI_TRANSITIONS=4001} [2022-01-19 04:15:19,515 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 493 predicate places. [2022-01-19 04:15:19,515 INFO L470 AbstractCegarLoop]: Abstraction has has 699 places, 4001 transitions, 81329 flow [2022-01-19 04:15:19,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 132.0) internal successors, (5808), 44 states have internal predecessors, (5808), 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-01-19 04:15:19,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:15:19,516 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:15:19,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 04:15:19,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:15:19,742 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:15:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:15:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -612431351, now seen corresponding path program 1 times [2022-01-19 04:15:19,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:15:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564942734] [2022-01-19 04:15:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:15:19,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:15:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:15:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:15:19,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:15:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564942734] [2022-01-19 04:15:19,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564942734] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:15:19,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669164933] [2022-01-19 04:15:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:15:19,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:15:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:15:20,000 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-01-19 04:15:20,001 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-01-19 04:15:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:15:20,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-19 04:15:20,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:15:20,169 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:15:20,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:15:20,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:15:20,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 04:15:20,732 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:15:20,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-01-19 04:15:20,795 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:15:20,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-19 04:15:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:15:20,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:15:20,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669164933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:15:20,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:15:20,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 27 [2022-01-19 04:15:20,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249290762] [2022-01-19 04:15:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:15:20,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:15:20,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:15:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:15:20,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-01-19 04:15:20,803 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:15:20,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 4001 transitions, 81329 flow. Second operand has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:15:20,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:15:20,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:15:20,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:15:36,976 INFO L129 PetriNetUnfolder]: 8858/28415 cut-off events. [2022-01-19 04:15:36,976 INFO L130 PetriNetUnfolder]: For 574518/576598 co-relation queries the response was YES. [2022-01-19 04:15:37,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159563 conditions, 28415 events. 8858/28415 cut-off events. For 574518/576598 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 333003 event pairs, 300 based on Foata normal form. 983/28637 useless extension candidates. Maximal degree in co-relation 156851. Up to 5721 conditions per place. [2022-01-19 04:15:37,784 INFO L132 encePairwiseOnDemand]: 206/226 looper letters, 1125 selfloop transitions, 358 changer transitions 0/4384 dead transitions. [2022-01-19 04:15:37,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 4384 transitions, 88055 flow [2022-01-19 04:15:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 04:15:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 04:15:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4164 transitions. [2022-01-19 04:15:37,787 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6580278128950695 [2022-01-19 04:15:37,788 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4164 transitions. [2022-01-19 04:15:37,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4164 transitions. [2022-01-19 04:15:37,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:15:37,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4164 transitions. [2022-01-19 04:15:37,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 148.71428571428572) internal successors, (4164), 28 states have internal predecessors, (4164), 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-01-19 04:15:37,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 226.0) internal successors, (6554), 29 states have internal predecessors, (6554), 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-01-19 04:15:37,798 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 226.0) internal successors, (6554), 29 states have internal predecessors, (6554), 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-01-19 04:15:37,798 INFO L186 Difference]: Start difference. First operand has 699 places, 4001 transitions, 81329 flow. Second operand 28 states and 4164 transitions. [2022-01-19 04:15:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 4384 transitions, 88055 flow [2022-01-19 04:15:43,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 4384 transitions, 86733 flow, removed 657 selfloop flow, removed 4 redundant places. [2022-01-19 04:15:44,026 INFO L242 Difference]: Finished difference. Result has 747 places, 4204 transitions, 83989 flow [2022-01-19 04:15:44,029 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=80007, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=83989, PETRI_PLACES=747, PETRI_TRANSITIONS=4204} [2022-01-19 04:15:44,030 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 541 predicate places. [2022-01-19 04:15:44,030 INFO L470 AbstractCegarLoop]: Abstraction has has 747 places, 4204 transitions, 83989 flow [2022-01-19 04:15:44,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:15:44,030 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:15:44,031 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:15:44,056 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-01-19 04:15:44,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-19 04:15:44,247 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:15:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:15:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1685750467, now seen corresponding path program 2 times [2022-01-19 04:15:44,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:15:44,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461706229] [2022-01-19 04:15:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:15:44,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:15:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:15:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:15:44,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:15:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461706229] [2022-01-19 04:15:44,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461706229] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:15:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716563902] [2022-01-19 04:15:44,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:15:44,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:15:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:15:44,504 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-01-19 04:15:44,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 04:15:44,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:15:44,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:15:44,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-19 04:15:44,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:15:44,667 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:15:44,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:15:44,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:15:45,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-19 04:15:45,402 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:15:45,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2022-01-19 04:15:45,424 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:15:45,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:15:45,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:15:45,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-01-19 04:15:45,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2022-01-19 04:15:45,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:15:45,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:15:45,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:15:45,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-01-19 04:15:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:15:45,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:15:45,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716563902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:15:45,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:15:45,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [17] total 30 [2022-01-19 04:15:45,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114918097] [2022-01-19 04:15:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:15:45,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 04:15:45,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:15:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 04:15:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-01-19 04:15:45,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 226 [2022-01-19 04:15:45,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 4204 transitions, 83989 flow. Second operand has 18 states, 18 states have (on average 140.61111111111111) internal successors, (2531), 18 states have internal predecessors, (2531), 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-01-19 04:15:45,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:15:45,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 226 [2022-01-19 04:15:45,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:16:02,768 INFO L129 PetriNetUnfolder]: 9131/29052 cut-off events. [2022-01-19 04:16:02,768 INFO L130 PetriNetUnfolder]: For 597259/599426 co-relation queries the response was YES. [2022-01-19 04:16:03,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163665 conditions, 29052 events. 9131/29052 cut-off events. For 597259/599426 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 339975 event pairs, 299 based on Foata normal form. 1020/29278 useless extension candidates. Maximal degree in co-relation 160863. Up to 3045 conditions per place. [2022-01-19 04:16:04,025 INFO L132 encePairwiseOnDemand]: 203/226 looper letters, 1042 selfloop transitions, 485 changer transitions 0/4425 dead transitions. [2022-01-19 04:16:04,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 4425 transitions, 89220 flow [2022-01-19 04:16:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 04:16:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 04:16:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4625 transitions. [2022-01-19 04:16:04,030 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6395188053097345 [2022-01-19 04:16:04,031 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4625 transitions. [2022-01-19 04:16:04,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4625 transitions. [2022-01-19 04:16:04,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:16:04,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4625 transitions. [2022-01-19 04:16:04,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 144.53125) internal successors, (4625), 32 states have internal predecessors, (4625), 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-01-19 04:16:04,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 226.0) internal successors, (7458), 33 states have internal predecessors, (7458), 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-01-19 04:16:04,042 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 226.0) internal successors, (7458), 33 states have internal predecessors, (7458), 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-01-19 04:16:04,042 INFO L186 Difference]: Start difference. First operand has 747 places, 4204 transitions, 83989 flow. Second operand 32 states and 4625 transitions. [2022-01-19 04:16:04,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 4425 transitions, 89220 flow [2022-01-19 04:16:10,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 4425 transitions, 89102 flow, removed 57 selfloop flow, removed 2 redundant places. [2022-01-19 04:16:10,226 INFO L242 Difference]: Finished difference. Result has 778 places, 4269 transitions, 86234 flow [2022-01-19 04:16:10,229 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=83877, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=86234, PETRI_PLACES=778, PETRI_TRANSITIONS=4269} [2022-01-19 04:16:10,231 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 572 predicate places. [2022-01-19 04:16:10,231 INFO L470 AbstractCegarLoop]: Abstraction has has 778 places, 4269 transitions, 86234 flow [2022-01-19 04:16:10,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 140.61111111111111) internal successors, (2531), 18 states have internal predecessors, (2531), 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-01-19 04:16:10,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:16:10,232 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:16:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 04:16:10,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-19 04:16:10,433 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:16:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:16:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -929886373, now seen corresponding path program 3 times [2022-01-19 04:16:10,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:16:10,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099577991] [2022-01-19 04:16:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:16:10,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:16:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:16:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:16:10,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:16:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099577991] [2022-01-19 04:16:10,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099577991] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:16:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595706563] [2022-01-19 04:16:10,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:16:10,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:16:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:16:10,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:16:10,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 04:16:10,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:16:10,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:16:10,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-19 04:16:10,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:16:10,971 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:16:10,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:16:11,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:16:11,527 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:16:11,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-01-19 04:16:11,613 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:16:11,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:16:11,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:16:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:16:11,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:16:11,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595706563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:16:11,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:16:11,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 28 [2022-01-19 04:16:11,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447051740] [2022-01-19 04:16:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:16:11,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:16:11,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:16:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:16:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-01-19 04:16:11,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:16:11,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 4269 transitions, 86234 flow. Second operand has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:16:11,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:16:11,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:16:11,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:16:31,695 INFO L129 PetriNetUnfolder]: 10075/31407 cut-off events. [2022-01-19 04:16:31,695 INFO L130 PetriNetUnfolder]: For 674600/676778 co-relation queries the response was YES. [2022-01-19 04:16:32,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180274 conditions, 31407 events. 10075/31407 cut-off events. For 674600/676778 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 367961 event pairs, 336 based on Foata normal form. 1037/31616 useless extension candidates. Maximal degree in co-relation 177400. Up to 3219 conditions per place. [2022-01-19 04:16:32,968 INFO L132 encePairwiseOnDemand]: 206/226 looper letters, 1226 selfloop transitions, 609 changer transitions 0/4736 dead transitions. [2022-01-19 04:16:32,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 4736 transitions, 96299 flow [2022-01-19 04:16:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 04:16:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 04:16:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4917 transitions. [2022-01-19 04:16:32,971 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6592920353982301 [2022-01-19 04:16:32,971 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4917 transitions. [2022-01-19 04:16:32,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4917 transitions. [2022-01-19 04:16:32,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:16:32,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4917 transitions. [2022-01-19 04:16:32,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 149.0) internal successors, (4917), 33 states have internal predecessors, (4917), 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-01-19 04:16:32,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 226.0) internal successors, (7684), 34 states have internal predecessors, (7684), 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-01-19 04:16:32,981 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 226.0) internal successors, (7684), 34 states have internal predecessors, (7684), 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-01-19 04:16:32,981 INFO L186 Difference]: Start difference. First operand has 778 places, 4269 transitions, 86234 flow. Second operand 33 states and 4917 transitions. [2022-01-19 04:16:32,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 4736 transitions, 96299 flow [2022-01-19 04:16:39,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 782 places, 4736 transitions, 95632 flow, removed 40 selfloop flow, removed 28 redundant places. [2022-01-19 04:16:39,782 INFO L242 Difference]: Finished difference. Result has 789 places, 4477 transitions, 91388 flow [2022-01-19 04:16:39,786 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=85576, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=91388, PETRI_PLACES=789, PETRI_TRANSITIONS=4477} [2022-01-19 04:16:39,786 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 583 predicate places. [2022-01-19 04:16:39,786 INFO L470 AbstractCegarLoop]: Abstraction has has 789 places, 4477 transitions, 91388 flow [2022-01-19 04:16:39,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:16:39,787 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:16:39,787 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:16:39,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 04:16:40,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-19 04:16:40,011 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:16:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:16:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1820252299, now seen corresponding path program 4 times [2022-01-19 04:16:40,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:16:40,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326991176] [2022-01-19 04:16:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:16:40,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:16:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:16:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 04:16:40,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:16:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326991176] [2022-01-19 04:16:40,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326991176] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:16:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692897096] [2022-01-19 04:16:40,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 04:16:40,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:16:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:16:40,301 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:16:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 04:16:40,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 04:16:40,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:16:40,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-19 04:16:40,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:16:40,454 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:16:40,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:16:40,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:16:41,032 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:16:41,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:16:41,053 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:16:41,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:16:41,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:16:41,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:16:41,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-19 04:16:41,101 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:16:41,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:16:41,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:16:41,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:16:41,236 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:16:41,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:16:41,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:16:41,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:16:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 04:16:41,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:16:41,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692897096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:16:41,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:16:41,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 26 [2022-01-19 04:16:41,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595227271] [2022-01-19 04:16:41,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:16:41,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:16:41,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:16:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:16:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-01-19 04:16:41,289 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:16:41,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 4477 transitions, 91388 flow. Second operand has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:16:41,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:16:41,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:16:41,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:17:08,620 INFO L129 PetriNetUnfolder]: 12461/37004 cut-off events. [2022-01-19 04:17:08,620 INFO L130 PetriNetUnfolder]: For 1084037/1086362 co-relation queries the response was YES. [2022-01-19 04:17:10,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229608 conditions, 37004 events. 12461/37004 cut-off events. For 1084037/1086362 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 435192 event pairs, 523 based on Foata normal form. 1162/37248 useless extension candidates. Maximal degree in co-relation 226727. Up to 3219 conditions per place. [2022-01-19 04:17:10,902 INFO L132 encePairwiseOnDemand]: 203/226 looper letters, 1478 selfloop transitions, 1359 changer transitions 0/5738 dead transitions. [2022-01-19 04:17:10,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 5738 transitions, 124435 flow [2022-01-19 04:17:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-19 04:17:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-01-19 04:17:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 8416 transitions. [2022-01-19 04:17:10,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6533147026859183 [2022-01-19 04:17:10,906 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 8416 transitions. [2022-01-19 04:17:10,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 8416 transitions. [2022-01-19 04:17:10,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:17:10,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 8416 transitions. [2022-01-19 04:17:10,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 147.64912280701753) internal successors, (8416), 57 states have internal predecessors, (8416), 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-01-19 04:17:10,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 226.0) internal successors, (13108), 58 states have internal predecessors, (13108), 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-01-19 04:17:10,918 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 226.0) internal successors, (13108), 58 states have internal predecessors, (13108), 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-01-19 04:17:10,918 INFO L186 Difference]: Start difference. First operand has 789 places, 4477 transitions, 91388 flow. Second operand 57 states and 8416 transitions. [2022-01-19 04:17:10,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 5738 transitions, 124435 flow [2022-01-19 04:17:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 5738 transitions, 122884 flow, removed 351 selfloop flow, removed 3 redundant places. [2022-01-19 04:17:19,285 INFO L242 Difference]: Finished difference. Result has 891 places, 5290 transitions, 112743 flow [2022-01-19 04:17:19,288 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=90877, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=685, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=112743, PETRI_PLACES=891, PETRI_TRANSITIONS=5290} [2022-01-19 04:17:19,291 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 685 predicate places. [2022-01-19 04:17:19,291 INFO L470 AbstractCegarLoop]: Abstraction has has 891 places, 5290 transitions, 112743 flow [2022-01-19 04:17:19,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:17:19,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:17:19,291 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:17:19,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 04:17:19,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:17:19,511 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:17:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:17:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1900704399, now seen corresponding path program 5 times [2022-01-19 04:17:19,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:17:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185307679] [2022-01-19 04:17:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:17:19,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:17:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:17:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:17:19,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:17:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185307679] [2022-01-19 04:17:19,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185307679] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:17:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757919525] [2022-01-19 04:17:19,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 04:17:19,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:17:19,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:17:19,811 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:17:19,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 04:17:19,944 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-19 04:17:19,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:17:19,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-19 04:17:19,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:17:20,019 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:17:20,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:17:20,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:17:20,674 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:17:20,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:17:20,696 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:17:20,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:17:20,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:17:20,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2022-01-19 04:17:20,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-01-19 04:17:20,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:17:20,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-19 04:17:20,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:17:20,924 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:17:20,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:17:20,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:17:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:17:20,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:17:20,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757919525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:17:20,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:17:20,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 28 [2022-01-19 04:17:20,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613259753] [2022-01-19 04:17:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:17:20,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 04:17:20,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:17:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 04:17:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-01-19 04:17:20,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 226 [2022-01-19 04:17:20,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 5290 transitions, 112743 flow. Second operand has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:17:20,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:17:20,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 226 [2022-01-19 04:17:20,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:18:07,202 INFO L129 PetriNetUnfolder]: 16890/48257 cut-off events. [2022-01-19 04:18:07,202 INFO L130 PetriNetUnfolder]: For 2568762/2571421 co-relation queries the response was YES. [2022-01-19 04:18:10,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345758 conditions, 48257 events. 16890/48257 cut-off events. For 2568762/2571421 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 565666 event pairs, 717 based on Foata normal form. 1334/48430 useless extension candidates. Maximal degree in co-relation 343477. Up to 4559 conditions per place. [2022-01-19 04:18:10,402 INFO L132 encePairwiseOnDemand]: 204/226 looper letters, 2456 selfloop transitions, 2329 changer transitions 0/7686 dead transitions. [2022-01-19 04:18:10,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 7686 transitions, 178107 flow [2022-01-19 04:18:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 04:18:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 04:18:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 9017 transitions. [2022-01-19 04:18:10,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6540693457130422 [2022-01-19 04:18:10,407 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 9017 transitions. [2022-01-19 04:18:10,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 9017 transitions. [2022-01-19 04:18:10,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:18:10,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 9017 transitions. [2022-01-19 04:18:10,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 147.81967213114754) internal successors, (9017), 61 states have internal predecessors, (9017), 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-01-19 04:18:10,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 226.0) internal successors, (14012), 62 states have internal predecessors, (14012), 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-01-19 04:18:10,421 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 226.0) internal successors, (14012), 62 states have internal predecessors, (14012), 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-01-19 04:18:10,421 INFO L186 Difference]: Start difference. First operand has 891 places, 5290 transitions, 112743 flow. Second operand 61 states and 9017 transitions. [2022-01-19 04:18:10,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 7686 transitions, 178107 flow [2022-01-19 04:18:29,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 7686 transitions, 169167 flow, removed 4445 selfloop flow, removed 5 redundant places. [2022-01-19 04:18:29,181 INFO L242 Difference]: Finished difference. Result has 1002 places, 6931 transitions, 151276 flow [2022-01-19 04:18:29,185 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=109015, PETRI_DIFFERENCE_MINUEND_PLACES=886, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=151276, PETRI_PLACES=1002, PETRI_TRANSITIONS=6931} [2022-01-19 04:18:29,185 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 796 predicate places. [2022-01-19 04:18:29,185 INFO L470 AbstractCegarLoop]: Abstraction has has 1002 places, 6931 transitions, 151276 flow [2022-01-19 04:18:29,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.93333333333334) internal successors, (2159), 15 states have internal predecessors, (2159), 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-01-19 04:18:29,186 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:18:29,186 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:18:29,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-19 04:18:29,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:18:29,396 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:18:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:18:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2081095728, now seen corresponding path program 1 times [2022-01-19 04:18:29,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:18:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106930647] [2022-01-19 04:18:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:18:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:18:29,408 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 04:18:29,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938553268] [2022-01-19 04:18:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:18:29,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:18:29,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:18:29,410 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:18:29,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 04:18:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:18:29,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 04:18:29,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:18:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:18:29,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:18:29,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:18:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106930647] [2022-01-19 04:18:29,699 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 04:18:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938553268] [2022-01-19 04:18:29,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938553268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:18:29,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:18:29,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:18:29,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332054861] [2022-01-19 04:18:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:18:29,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:18:29,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:18:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:18:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:18:29,702 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 226 [2022-01-19 04:18:29,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 6931 transitions, 151276 flow. Second operand has 8 states, 8 states have (on average 179.625) internal successors, (1437), 8 states have internal predecessors, (1437), 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-01-19 04:18:29,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:18:29,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 226 [2022-01-19 04:18:29,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:19:00,712 INFO L129 PetriNetUnfolder]: 12172/41242 cut-off events. [2022-01-19 04:19:00,712 INFO L130 PetriNetUnfolder]: For 1229711/1234203 co-relation queries the response was YES. [2022-01-19 04:19:03,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253535 conditions, 41242 events. 12172/41242 cut-off events. For 1229711/1234203 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 507674 event pairs, 139 based on Foata normal form. 1604/42063 useless extension candidates. Maximal degree in co-relation 252768. Up to 2633 conditions per place. [2022-01-19 04:19:03,336 INFO L132 encePairwiseOnDemand]: 218/226 looper letters, 231 selfloop transitions, 7 changer transitions 370/6929 dead transitions. [2022-01-19 04:19:03,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 6929 transitions, 151804 flow [2022-01-19 04:19:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:19:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:19:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1618 transitions. [2022-01-19 04:19:03,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954768928220256 [2022-01-19 04:19:03,337 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1618 transitions. [2022-01-19 04:19:03,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1618 transitions. [2022-01-19 04:19:03,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:19:03,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1618 transitions. [2022-01-19 04:19:03,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.77777777777777) internal successors, (1618), 9 states have internal predecessors, (1618), 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-01-19 04:19:03,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:19:03,340 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:19:03,340 INFO L186 Difference]: Start difference. First operand has 1002 places, 6931 transitions, 151276 flow. Second operand 9 states and 1618 transitions. [2022-01-19 04:19:03,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 6929 transitions, 151804 flow [2022-01-19 04:19:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 6929 transitions, 148655 flow, removed 1555 selfloop flow, removed 4 redundant places. [2022-01-19 04:19:18,244 INFO L242 Difference]: Finished difference. Result has 1004 places, 6559 transitions, 140236 flow [2022-01-19 04:19:18,248 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=148123, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=140236, PETRI_PLACES=1004, PETRI_TRANSITIONS=6559} [2022-01-19 04:19:18,248 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 798 predicate places. [2022-01-19 04:19:18,248 INFO L470 AbstractCegarLoop]: Abstraction has has 1004 places, 6559 transitions, 140236 flow [2022-01-19 04:19:18,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.625) internal successors, (1437), 8 states have internal predecessors, (1437), 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-01-19 04:19:18,248 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:19:18,248 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:19:18,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-19 04:19:18,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-19 04:19:18,449 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:19:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:19:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash -172565046, now seen corresponding path program 1 times [2022-01-19 04:19:18,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:19:18,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210163553] [2022-01-19 04:19:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:19:18,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:19:18,461 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-19 04:19:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980435978] [2022-01-19 04:19:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:19:18,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:19:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:19:18,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:19:18,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 04:19:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:19:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 04:19:18,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:19:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:19:18,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:19:18,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:19:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210163553] [2022-01-19 04:19:18,765 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-19 04:19:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980435978] [2022-01-19 04:19:18,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980435978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:19:18,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:19:18,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:19:18,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181252800] [2022-01-19 04:19:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:19:18,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:19:18,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:19:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:19:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:19:18,767 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 226 [2022-01-19 04:19:18,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 6559 transitions, 140236 flow. Second operand has 8 states, 8 states have (on average 179.625) internal successors, (1437), 8 states have internal predecessors, (1437), 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-01-19 04:19:18,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:19:18,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 226 [2022-01-19 04:19:18,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:19:47,131 INFO L129 PetriNetUnfolder]: 11668/39415 cut-off events. [2022-01-19 04:19:47,131 INFO L130 PetriNetUnfolder]: For 1132126/1136493 co-relation queries the response was YES. [2022-01-19 04:19:49,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241504 conditions, 39415 events. 11668/39415 cut-off events. For 1132126/1136493 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 481648 event pairs, 137 based on Foata normal form. 1531/40445 useless extension candidates. Maximal degree in co-relation 240653. Up to 2497 conditions per place. [2022-01-19 04:19:49,613 INFO L132 encePairwiseOnDemand]: 218/226 looper letters, 217 selfloop transitions, 7 changer transitions 378/6557 dead transitions. [2022-01-19 04:19:49,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 6557 transitions, 140708 flow [2022-01-19 04:19:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:19:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:19:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1618 transitions. [2022-01-19 04:19:49,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7954768928220256 [2022-01-19 04:19:49,614 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1618 transitions. [2022-01-19 04:19:49,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1618 transitions. [2022-01-19 04:19:49,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:19:49,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1618 transitions. [2022-01-19 04:19:49,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 179.77777777777777) internal successors, (1618), 9 states have internal predecessors, (1618), 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-01-19 04:19:49,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:19:49,617 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 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-01-19 04:19:49,617 INFO L186 Difference]: Start difference. First operand has 1004 places, 6559 transitions, 140236 flow. Second operand 9 states and 1618 transitions. [2022-01-19 04:19:49,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 6557 transitions, 140708 flow [2022-01-19 04:20:01,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 6557 transitions, 139599 flow, removed 76 selfloop flow, removed 12 redundant places. [2022-01-19 04:20:02,098 INFO L242 Difference]: Finished difference. Result has 998 places, 6179 transitions, 130550 flow [2022-01-19 04:20:02,101 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=139123, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=130550, PETRI_PLACES=998, PETRI_TRANSITIONS=6179} [2022-01-19 04:20:02,101 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 792 predicate places. [2022-01-19 04:20:02,101 INFO L470 AbstractCegarLoop]: Abstraction has has 998 places, 6179 transitions, 130550 flow [2022-01-19 04:20:02,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.625) internal successors, (1437), 8 states have internal predecessors, (1437), 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-01-19 04:20:02,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:20:02,102 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:20:02,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 04:20:02,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:20:02,302 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:20:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:20:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1466526536, now seen corresponding path program 1 times [2022-01-19 04:20:02,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:20:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912839343] [2022-01-19 04:20:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:20:02,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:20:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:20:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:20:02,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:20:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912839343] [2022-01-19 04:20:02,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912839343] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:20:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241080985] [2022-01-19 04:20:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:20:02,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:20:02,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:20:02,581 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:20:02,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 04:20:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:20:02,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-19 04:20:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:20:02,765 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:20:02,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:20:02,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:20:03,516 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:20:03,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:20:03,538 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-01-19 04:20:03,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 72 [2022-01-19 04:20:03,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:20:03,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:20:03,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-19 04:20:03,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:20:03,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:20:03,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:20:03,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-19 04:20:03,793 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:20:03,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:20:03,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:20:03,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:20:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:20:03,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:20:03,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) is different from false [2022-01-19 04:20:03,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:20:03,923 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:20:03,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_#res#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:20:03,964 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:20:03,977 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0) (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))))))) is different from false [2022-01-19 04:20:04,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0) (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (not .cse0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))))) is different from false [2022-01-19 04:20:04,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|))) (and (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse0)) (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_894) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0))) is different from false [2022-01-19 04:20:04,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0))) is different from false [2022-01-19 04:20:04,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0))) is different from false [2022-01-19 04:20:04,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int) (v_ArrVal_898 (Array Int Int)) (|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select (store |c_#memory_int| |c_~#seed~0.base| v_ArrVal_896) |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_898) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0))) is different from false [2022-01-19 04:20:04,489 INFO L353 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-01-19 04:20:04,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2022-01-19 04:20:04,498 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:20:04,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 216 [2022-01-19 04:20:04,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 173 [2022-01-19 04:20:04,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 171 [2022-01-19 04:20:04,743 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 04:20:04,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 04:20:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2022-01-19 04:20:04,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241080985] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:20:04,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:20:04,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 18] total 44 [2022-01-19 04:20:04,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836297242] [2022-01-19 04:20:04,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:20:04,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-19 04:20:04,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:20:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-19 04:20:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=916, Unknown=11, NotChecked=792, Total=1892 [2022-01-19 04:20:04,762 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 226 [2022-01-19 04:20:04,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 6179 transitions, 130550 flow. Second operand has 44 states, 44 states have (on average 132.27272727272728) internal successors, (5820), 44 states have internal predecessors, (5820), 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-01-19 04:20:04,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:20:04,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 226 [2022-01-19 04:20:04,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:21:13,122 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([697] L743-6-->L743-7: Formula: true InVars {} OutVars{thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1=|v_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1_11|} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1][7890], [Black: 4016#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 3980#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6125#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4036#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 6092#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 3992#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6026#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 4061#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6032#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 3990#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6111#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), 4489#true, Black: 3976#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6052#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 3986#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6074#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 3967#(and (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6098#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 3996#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6086#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4045#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6028#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4032#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 6038#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4010#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6106#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4002#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5775#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 6104#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6117#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6034#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), 265#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#seed~0.base|)), Black: 6082#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 5984#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 6062#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 6056#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 6069#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5596#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6066#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 6046#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5239#true, Black: 6078#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5652#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6080#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5600#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 6115#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5592#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 5630#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 6050#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5570#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6040#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6123#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5574#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 2548#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5610#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 6042#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 2424#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5586#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6030#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 2584#(and (exists ((|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5566#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6048#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 2550#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6036#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5644#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 6100#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 2580#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5562#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), 1138#true, Black: 2578#(and (exists ((|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5243#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 6054#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 2572#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 6060#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5616#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 2560#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5720#(not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 5584#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 6058#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 2568#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 5612#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 6076#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 2570#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5648#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 2582#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6102#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 2556#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5588#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 2562#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 5604#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 2558#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5578#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 2586#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5594#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 2564#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 5614#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 2574#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5646#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 2552#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5558#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 2554#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 5598#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 2588#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 5634#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5606#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 2576#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 5572#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5602#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 2546#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 2566#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 5568#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5576#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5608#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5638#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5590#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1))), Black: 5626#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5620#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5618#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5636#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5642#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5564#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5582#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), 4863#true, Black: 5624#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5650#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 5640#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 5560#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 5622#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 5580#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 579#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 523#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 543#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 553#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 583#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 533#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 573#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 561#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 517#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 513#(and (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 551#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 525#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 515#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 585#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 539#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 541#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 569#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), 6795#(and (< |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1| 10) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#in~n#1| 10) (< |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#res#1| 10) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~n#1| 10)), Black: 511#(and (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 529#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 565#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 575#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 577#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 535#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 555#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 557#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 567#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 559#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0)), Black: 1110#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 537#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 1122#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 519#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 1098#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0)), 1850#true, Black: 571#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 1116#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 545#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 1108#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 509#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 1106#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0)), Black: 527#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 777#(not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 581#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 1077#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0)), Black: 547#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 1096#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), 496#(and (= ~state~0 1) (= |~#seed~0.offset| 0)), Black: 521#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 761#true, Black: 531#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 1118#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 549#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 1086#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0)), Black: 5184#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 563#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5218#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 5226#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), 297#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1)), Black: 5228#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5230#(and (= 3 |~#seed~0.base|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 5163#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 2216#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 630#(and (= ~state~0 1) (= |~#seed~0.offset| 0)), Black: 687#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 715#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 671#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 675#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 717#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 643#(and (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 661#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 665#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 683#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 701#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 679#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 689#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 693#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0)), Black: 659#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 647#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 669#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 649#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 221#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 673#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 218#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1)), Black: 691#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 223#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 709#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 695#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 699#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 655#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 651#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 697#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 657#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 719#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 681#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 667#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 677#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0)), Black: 705#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 685#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 707#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 653#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 2616#(and (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 3295#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 711#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 663#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 3293#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 713#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 2918#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 703#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 3288#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3281#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |~#seed~0.offset| 0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |#memory_int| |~#seed~0.base| (store (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#res#1|)) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |~#seed~0.base|) |~#seed~0.offset|) 0)))), Black: 3307#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3309#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 3312#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 3277#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |~#seed~0.offset| 0) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |#memory_int| |~#seed~0.base| (store (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |~#seed~0.base|) |~#seed~0.offset|) 0)))), Black: 4505#(not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 3285#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (store |#memory_int| |~#seed~0.base| (store (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset| |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1|)) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_474) |~#seed~0.base|) |~#seed~0.offset|) 0))) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 2630#(not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 3283#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3303#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 2614#true, Black: 3301#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3299#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 251#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= ~m~0 0)), Black: 259#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 275#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), 4028#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 255#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= ~m~0 0) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 249#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1)), Black: 261#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= ~m~0 0) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), 490#(and (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1|)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread1of2ForFork0_calculateNext_#in~s2#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1| |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |thr1Thread1of2ForFork0_calculateNext_~s2#1| |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 1822#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 1810#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 1820#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 1830#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 1818#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 302#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 1789#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 1808#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), 74#L726-5true, Black: 304#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 300#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1)), Black: 1834#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 1828#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 1798#(and (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 1485#(not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), 1469#true, 4110#true, Black: 338#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= ~m~0 0) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 336#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= ~m~0 0)), Black: 344#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= ~m~0 0) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 356#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 340#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 1)), Black: 4462#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 4452#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 4446#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 4436#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4403#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 4126#(not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 4181#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 4442#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 4318#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 372#(and (= ~state~0 1) (not |thr1Thread2of2ForFork0_#t~switch10#1|)), Black: 4434#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4450#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 4430#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4444#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4460#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 4456#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), 3314#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0)), Black: 4308#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 4428#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 4458#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 4438#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4432#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 4448#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4454#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 4440#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4426#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), 5703#true, 2297#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), 5457#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 424#true, Black: 1210#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 1454#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), Black: 429#(and (= ~state~0 1) (not |thr1Thread1of2ForFork0_#t~switch10#1|)), Black: 1343#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 1452#(and (exists ((|thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) |~#seed~0.offset|) 1)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 1353#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 1391#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0)), Black: 1155#(not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)), Black: 1409#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 1395#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0)), Black: 1357#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), Black: 1399#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= |~#seed~0.offset| 0)), 6877#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0)), 350#(and (not (= |~#seed~0.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_#in~init#1| 1) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_constructor_~init#1| 1) (= 3 |~#seed~0.base|)), 20#L743-7true, 88#L778-4true, 426#(= ~state~0 1), Black: 4030#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3965#(and (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 4022#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 4008#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 4053#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3954#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 4063#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 4039#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 4034#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 3974#(and (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 3970#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 4041#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 4026#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6113#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4043#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 6088#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 4005#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6090#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), 645#(and (= ~state~0 1) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (= |~#seed~0.offset| 0)), Black: 6044#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0))), Black: 6108#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4019#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 3983#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6084#(and (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 4024#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1|)), Black: 6024#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 3999#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6072#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0)), Black: 6119#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4013#(and (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6121#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4055#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= |thr1Thread2of2ForFork0_calculateNext_#res#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6064#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1| 0))), Black: 6127#(and (not (= |thr1Thread1of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= 0 |thr1Thread1of2ForFork0_calculateNext_#res#1|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 4051#(and (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|) (= ~state~0 1) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (not (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0)) (= |~#seed~0.offset| 0) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| 3))), Black: 6094#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (not (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0)) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1))), Black: 6096#(and (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) 0)) (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (exists ((|thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base| Int)) (= (select (select |#memory_int| |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r#1.base|) 0) 1)) (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|)), Black: 3474#(and (= ~state~0 1) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0)), Black: 3962#(and (= ~state~0 1) (= 3 |~#seed~0.base|) (= |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| |~#seed~0.offset|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#seed~0.offset| 0) (forall ((|thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| Int)) (or (and (forall ((v_ArrVal_521 (Array Int Int))) (or (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |~#seed~0.base|) |~#seed~0.offset|)) (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_525) |~#seed~0.base|) |~#seed~0.offset|) 0))))) (forall ((v_ArrVal_521 (Array Int Int))) (or (forall ((v_ArrVal_523 (Array Int Int))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |~#seed~0.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |~#seed~0.base|) |~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1|)) |thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base| v_ArrVal_523) |~#seed~0.base|) |~#seed~0.offset|) 0))) (not (= (select (select |#memory_int| |~#seed~0.base|) |~#seed~0.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_521) |~#seed~0.base|) |~#seed~0.offset|)))))) (= |thr1Thread2of2ForFork0_calculateNext_#t~nondet3#1| 0)))), Black: 5908#(and (= |thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 0) (= 3 |~#seed~0.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#seed~0.offset| 0))]) [2022-01-19 04:21:13,125 INFO L384 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-01-19 04:21:13,126 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-01-19 04:21:13,126 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-01-19 04:21:13,126 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-01-19 04:21:13,636 INFO L129 PetriNetUnfolder]: 22228/57906 cut-off events. [2022-01-19 04:21:13,636 INFO L130 PetriNetUnfolder]: For 1986706/1990867 co-relation queries the response was YES. [2022-01-19 04:21:19,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425537 conditions, 57906 events. 22228/57906 cut-off events. For 1986706/1990867 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 659438 event pairs, 990 based on Foata normal form. 1132/58463 useless extension candidates. Maximal degree in co-relation 425103. Up to 18529 conditions per place. [2022-01-19 04:21:19,427 INFO L132 encePairwiseOnDemand]: 196/226 looper letters, 3849 selfloop transitions, 2485 changer transitions 95/8853 dead transitions. [2022-01-19 04:21:19,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1054 places, 8853 transitions, 196726 flow [2022-01-19 04:21:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 04:21:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 04:21:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 8243 transitions. [2022-01-19 04:21:19,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6078908554572271 [2022-01-19 04:21:19,431 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 8243 transitions. [2022-01-19 04:21:19,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 8243 transitions. [2022-01-19 04:21:19,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:21:19,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 8243 transitions. [2022-01-19 04:21:19,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 137.38333333333333) internal successors, (8243), 60 states have internal predecessors, (8243), 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-01-19 04:21:19,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 226.0) internal successors, (13786), 61 states have internal predecessors, (13786), 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-01-19 04:21:19,447 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 226.0) internal successors, (13786), 61 states have internal predecessors, (13786), 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-01-19 04:21:19,448 INFO L186 Difference]: Start difference. First operand has 998 places, 6179 transitions, 130550 flow. Second operand 60 states and 8243 transitions. [2022-01-19 04:21:19,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1054 places, 8853 transitions, 196726 flow [2022-01-19 04:21:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 8853 transitions, 196656 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-01-19 04:21:47,496 INFO L242 Difference]: Finished difference. Result has 1089 places, 7834 transitions, 179688 flow [2022-01-19 04:21:47,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=130480, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=179688, PETRI_PLACES=1089, PETRI_TRANSITIONS=7834} [2022-01-19 04:21:47,500 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 883 predicate places. [2022-01-19 04:21:47,501 INFO L470 AbstractCegarLoop]: Abstraction has has 1089 places, 7834 transitions, 179688 flow [2022-01-19 04:21:47,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 132.27272727272728) internal successors, (5820), 44 states have internal predecessors, (5820), 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-01-19 04:21:47,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:21:47,502 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:21:47,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 04:21:47,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:21:47,702 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:21:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:21:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash -596726056, now seen corresponding path program 2 times [2022-01-19 04:21:47,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:21:47,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811796906] [2022-01-19 04:21:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:21:47,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:21:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:21:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:21:48,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:21:48,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811796906] [2022-01-19 04:21:48,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811796906] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:21:48,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946053253] [2022-01-19 04:21:48,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:21:48,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:21:48,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:21:48,019 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:21:48,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 04:21:48,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:21:48,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:21:48,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-19 04:21:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:21:48,215 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:21:48,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:21:48,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:21:48,800 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:21:48,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-01-19 04:21:48,889 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:21:48,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:21:48,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:21:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:21:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:21:48,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) is different from false [2022-01-19 04:21:48,979 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~nexts~0#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))))) is different from false [2022-01-19 04:21:49,005 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0) (or (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_#t~ret6#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:21:49,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (not .cse0) (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_#res#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:21:49,042 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (not .cse0) (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |c_thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)))) (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:21:49,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:21:49,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int) (|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)))) (store .cse0 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse0 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0)) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) is different from false [2022-01-19 04:21:49,784 INFO L353 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-01-19 04:21:49,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2022-01-19 04:21:49,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:21:49,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2022-01-19 04:21:49,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-01-19 04:21:49,885 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 04:21:49,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 04:21:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2022-01-19 04:21:49,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946053253] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:21:49,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:21:49,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 41 [2022-01-19 04:21:49,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270496245] [2022-01-19 04:21:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:21:49,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 04:21:49,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:21:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 04:21:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=930, Unknown=11, NotChecked=490, Total=1640 [2022-01-19 04:21:49,911 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 226 [2022-01-19 04:21:49,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 7834 transitions, 179688 flow. Second operand has 41 states, 41 states have (on average 132.41463414634146) internal successors, (5429), 41 states have internal predecessors, (5429), 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-01-19 04:21:49,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:21:49,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 226 [2022-01-19 04:21:49,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:22:38,155 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| Int)) (or (let ((.cse0 (= (select (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1|))) (and (or (forall ((v_ArrVal_941 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| v_ArrVal_941) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_948 (Array Int Int)) (|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| Int)) (not (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#seed~0.base| (store (select |c_#memory_int| |c_~#seed~0.base|) |c_~#seed~0.offset| |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1|)))) (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11| (store (select .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r#1.base_11|) |c_thr1Thread2of2ForFork0_PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_948) |c_~#seed~0.base|) |c_~#seed~0.offset|))))))) (= |thr1Thread2of2ForFork0_calculateNext_~calculateNext_return~0#1| 0))) (not (= |c_thr1Thread1of2ForFork0_PseudoRandomUsingAtomic_monitor_#t~mem8#1| 0))) is different from false [2022-01-19 04:24:03,787 INFO L129 PetriNetUnfolder]: 29183/74640 cut-off events. [2022-01-19 04:24:03,787 INFO L130 PetriNetUnfolder]: For 2862173/2866563 co-relation queries the response was YES. [2022-01-19 04:24:13,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599855 conditions, 74640 events. 29183/74640 cut-off events. For 2862173/2866563 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 876369 event pairs, 1119 based on Foata normal form. 1306/75269 useless extension candidates. Maximal degree in co-relation 598681. Up to 19087 conditions per place. [2022-01-19 04:24:13,777 INFO L132 encePairwiseOnDemand]: 195/226 looper letters, 4588 selfloop transitions, 5193 changer transitions 3/12208 dead transitions. [2022-01-19 04:24:13,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1152 places, 12208 transitions, 309952 flow [2022-01-19 04:24:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-01-19 04:24:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-01-19 04:24:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 8722 transitions. [2022-01-19 04:24:13,782 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6030143805309734 [2022-01-19 04:24:13,782 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 8722 transitions. [2022-01-19 04:24:13,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 8722 transitions. [2022-01-19 04:24:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:24:13,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 8722 transitions. [2022-01-19 04:24:13,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 136.28125) internal successors, (8722), 64 states have internal predecessors, (8722), 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-01-19 04:24:13,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 226.0) internal successors, (14690), 65 states have internal predecessors, (14690), 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-01-19 04:24:13,799 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 226.0) internal successors, (14690), 65 states have internal predecessors, (14690), 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-01-19 04:24:13,799 INFO L186 Difference]: Start difference. First operand has 1089 places, 7834 transitions, 179688 flow. Second operand 64 states and 8722 transitions. [2022-01-19 04:24:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1152 places, 12208 transitions, 309952 flow [2022-01-19 04:25:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1150 places, 12208 transitions, 308520 flow, removed 714 selfloop flow, removed 2 redundant places. [2022-01-19 04:25:13,078 INFO L242 Difference]: Finished difference. Result has 1196 places, 11287 transitions, 293743 flow [2022-01-19 04:25:13,083 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=178862, PETRI_DIFFERENCE_MINUEND_PLACES=1087, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=293743, PETRI_PLACES=1196, PETRI_TRANSITIONS=11287} [2022-01-19 04:25:13,083 INFO L334 CegarLoopForPetriNet]: 206 programPoint places, 990 predicate places. [2022-01-19 04:25:13,083 INFO L470 AbstractCegarLoop]: Abstraction has has 1196 places, 11287 transitions, 293743 flow [2022-01-19 04:25:13,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 132.41463414634146) internal successors, (5429), 41 states have internal predecessors, (5429), 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-01-19 04:25:13,084 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:25:13,084 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:25:13,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 04:25:13,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-19 04:25:13,285 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-01-19 04:25:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:25:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash -182613136, now seen corresponding path program 3 times [2022-01-19 04:25:13,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:25:13,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103072558] [2022-01-19 04:25:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:25:13,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:25:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:25:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-19 04:25:13,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:25:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103072558] [2022-01-19 04:25:13,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103072558] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:25:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503050039] [2022-01-19 04:25:13,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:25:13,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:25:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:25:13,317 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:25:13,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-19 04:25:13,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:25:13,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:25:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 04:25:13,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:25:13,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:25:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-19 04:25:13,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:25:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-19 04:25:13,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503050039] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:25:13,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:25:13,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-01-19 04:25:13,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230478418] [2022-01-19 04:25:13,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:25:13,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:25:13,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:25:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:25:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:25:13,672 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 226 [2022-01-19 04:25:13,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1196 places, 11287 transitions, 293743 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 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-01-19 04:25:13,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:25:13,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 226 [2022-01-19 04:25:13,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-01-19 04:25:59,426 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-01-19 04:25:59,426 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 04:26:00,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-19 04:26:00,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-01-19 04:26:00,555 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-01-19 04:26:00,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 04:26:00,555 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 04:26:00,555 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-01-19 04:26:00,555 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-01-19 04:26:00,555 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2022-01-19 04:26:00,555 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2022-01-19 04:26:00,556 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2022-01-19 04:26:00,556 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2022-01-19 04:26:00,556 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-01-19 04:26:00,556 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-01-19 04:26:00,556 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:26:00,556 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 04:26:00,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 04:26:00,557 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:26:00,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 04:26:00,558 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 04:26:00,558 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 04:26:00,558 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 04:26:00,558 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 04:26:00,558 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-01-19 04:26:00,558 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:26:00,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:26:00 BasicIcfg [2022-01-19 04:26:00,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:26:00,562 INFO L158 Benchmark]: Toolchain (without parser) took 738611.24ms. Allocated memory was 379.6MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 323.4MB in the beginning and 8.9GB in the end (delta: -8.5GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. [2022-01-19 04:26:00,562 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 341.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:26:00,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.78ms. Allocated memory was 379.6MB in the beginning and 469.8MB in the end (delta: 90.2MB). Free memory was 323.2MB in the beginning and 433.5MB in the end (delta: -110.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.0GB. [2022-01-19 04:26:00,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.95ms. Allocated memory is still 469.8MB. Free memory was 433.5MB in the beginning and 430.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:26:00,563 INFO L158 Benchmark]: Boogie Preprocessor took 37.57ms. Allocated memory is still 469.8MB. Free memory was 430.4MB in the beginning and 429.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:26:00,563 INFO L158 Benchmark]: RCFGBuilder took 540.91ms. Allocated memory is still 469.8MB. Free memory was 429.3MB in the beginning and 408.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-19 04:26:00,563 INFO L158 Benchmark]: TraceAbstraction took 737550.46ms. Allocated memory was 469.8MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 407.3MB in the beginning and 8.9GB in the end (delta: -8.4GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. [2022-01-19 04:26:00,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 341.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 417.78ms. Allocated memory was 379.6MB in the beginning and 469.8MB in the end (delta: 90.2MB). Free memory was 323.2MB in the beginning and 433.5MB in the end (delta: -110.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.95ms. Allocated memory is still 469.8MB. Free memory was 433.5MB in the beginning and 430.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.57ms. Allocated memory is still 469.8MB. Free memory was 430.4MB in the beginning and 429.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 540.91ms. Allocated memory is still 469.8MB. Free memory was 429.3MB in the beginning and 408.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 737550.46ms. Allocated memory was 469.8MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 407.3MB in the beginning and 8.9GB in the end (delta: -8.4GB). Peak memory consumption was 7.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 743]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 730]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 754]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 778]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 202 locations, 7 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: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 30 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=1, InterpolantAutomatonStates: 24, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 287 locations, 10 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: 735.9s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 694.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6361 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6361 mSDsluCounter, 14449 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8365 IncrementalHoareTripleChecker+Unchecked, 14616 mSDsCounter, 591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14275 IncrementalHoareTripleChecker+Invalid, 23231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 591 mSolverCounterUnsat, 1746 mSDtfsCounter, 14275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3229 GetRequests, 2031 SyntacticMatches, 58 SemanticMatches, 1140 ConstructedPredicates, 36 IntricatePredicates, 24 DeprecatedPredicates, 16931 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293743occurred in iteration=31, InterpolantAutomatonStates: 786, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 35.1s InterpolantComputationTime, 4091 NumberOfCodeBlocks, 4052 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 4533 ConstructedInterpolants, 335 QuantifiedInterpolants, 54701 SizeOfPredicates, 354 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 858 ConjunctsInUnsatCore, 52 InterpolantComputations, 27 PerfectInterpolantSequences, 441/656 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 202 locations, 7 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: 0.1s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 287 locations, 10 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: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown