/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/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 03:53:36,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:53:36,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:53:36,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:53:36,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:53:36,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:53:36,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:53:36,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:53:36,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:53:36,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:53:36,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:53:36,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:53:36,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:53:36,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:53:36,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:53:36,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:53:36,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:53:36,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:53:36,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:53:36,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:53:36,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:53:36,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:53:36,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:53:36,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:53:36,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:53:36,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:53:36,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:53:36,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:53:36,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:53:36,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:53:36,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:53:36,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:53:36,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:53:36,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:53:36,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:53:36,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:53:36,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:53:36,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:53:36,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:53:36,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:53:36,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:53:36,565 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 03:53:36,587 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:53:36,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:53:36,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:53:36,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:53:36,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:53:36,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:53:36,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:53:36,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:53:36,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:53:36,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:53:36,591 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 03:53:36,591 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 03:53:36,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:53:36,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:53:36,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:53:36,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:53:36,775 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:53:36,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-01-19 03:53:36,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcded15cb/be6bad89d0e04de3875fc9f44c2cef6a/FLAG9a92a3763 [2022-01-19 03:53:37,215 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:53:37,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-01-19 03:53:37,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcded15cb/be6bad89d0e04de3875fc9f44c2cef6a/FLAG9a92a3763 [2022-01-19 03:53:37,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcded15cb/be6bad89d0e04de3875fc9f44c2cef6a [2022-01-19 03:53:37,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:53:37,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:53:37,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:53:37,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:53:37,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:53:37,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265b2553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37, skipping insertion in model container [2022-01-19 03:53:37,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:53:37,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:53:37,557 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/queue_ok.i[43266,43279] [2022-01-19 03:53:37,562 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/queue_ok.i[43543,43556] [2022-01-19 03:53:37,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:53:37,571 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:53:37,596 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/queue_ok.i[43266,43279] [2022-01-19 03:53:37,597 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/queue_ok.i[43543,43556] [2022-01-19 03:53:37,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:53:37,631 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:53:37,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37 WrapperNode [2022-01-19 03:53:37,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:53:37,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:53:37,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:53:37,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:53:37,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,673 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-01-19 03:53:37,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:53:37,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:53:37,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:53:37,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:53:37,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:53:37,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:53:37,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:53:37,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:53:37,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (1/1) ... [2022-01-19 03:53:37,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:53:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:53:37,736 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 03:53:37,746 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 03:53:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 03:53:37,760 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 03:53:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 03:53:37,760 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 03:53:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:53:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:53:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:53:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:53:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 03:53:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:53:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:53:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:53:37,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:53:37,762 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 03:53:37,844 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:53:37,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:53:38,055 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:53:38,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:53:38,061 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 03:53:38,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:53:38 BoogieIcfgContainer [2022-01-19 03:53:38,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:53:38,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:53:38,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:53:38,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:53:38,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:53:37" (1/3) ... [2022-01-19 03:53:38,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cccd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:53:38, skipping insertion in model container [2022-01-19 03:53:38,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:53:37" (2/3) ... [2022-01-19 03:53:38,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cccd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:53:38, skipping insertion in model container [2022-01-19 03:53:38,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:53:38" (3/3) ... [2022-01-19 03:53:38,067 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-01-19 03:53:38,071 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:53:38,071 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 03:53:38,071 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:53:38,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,118 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,119 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,129 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,131 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,132 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,132 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,132 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,132 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,132 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,133 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,134 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,135 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,136 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,137 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,145 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,145 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,146 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,156 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,156 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,156 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,157 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,172 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,175 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,178 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,179 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,179 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,179 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,179 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,183 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,183 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,183 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,183 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,184 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,186 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:53:38,203 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:53:38,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:53:38,250 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 03:53:38,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 03:53:38,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-01-19 03:53:38,310 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-01-19 03:53:38,310 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:53:38,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-01-19 03:53:38,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-01-19 03:53:38,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-01-19 03:53:38,331 INFO L129 PetriNetUnfolder]: 2/67 cut-off events. [2022-01-19 03:53:38,331 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 03:53:38,331 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:38,331 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] [2022-01-19 03:53:38,332 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:38,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-01-19 03:53:38,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:38,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692775685] [2022-01-19 03:53:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:38,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:38,514 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 03:53:38,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692775685] [2022-01-19 03:53:38,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692775685] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:38,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:38,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 03:53:38,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067192351] [2022-01-19 03:53:38,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:38,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 03:53:38,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:38,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 03:53:38,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 03:53:38,550 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-01-19 03:53:38,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 03:53:38,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:38,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-01-19 03:53:38,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:38,593 INFO L129 PetriNetUnfolder]: 9/210 cut-off events. [2022-01-19 03:53:38,593 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 03:53:38,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 276 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-01-19 03:53:38,596 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-01-19 03:53:38,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-01-19 03:53:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 03:53:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 03:53:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-01-19 03:53:38,605 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-01-19 03:53:38,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-01-19 03:53:38,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-01-19 03:53:38,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:38,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-01-19 03:53:38,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 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 03:53:38,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 03:53:38,621 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 03:53:38,622 INFO L186 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-01-19 03:53:38,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-01-19 03:53:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 03:53:38,628 INFO L242 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-01-19 03:53:38,634 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-01-19 03:53:38,637 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-01-19 03:53:38,637 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-01-19 03:53:38,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 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 03:53:38,637 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:38,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:38,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 03:53:38,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-01-19 03:53:38,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:38,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732497701] [2022-01-19 03:53:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:38,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:38,939 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 03:53:38,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:38,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732497701] [2022-01-19 03:53:38,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732497701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:38,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:38,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 03:53:38,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91866010] [2022-01-19 03:53:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:38,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 03:53:38,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 03:53:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-01-19 03:53:38,946 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-01-19 03:53:38,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 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 03:53:38,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:38,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-01-19 03:53:38,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:39,524 INFO L129 PetriNetUnfolder]: 611/2582 cut-off events. [2022-01-19 03:53:39,524 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-01-19 03:53:39,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 20617 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-01-19 03:53:39,541 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-01-19 03:53:39,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-01-19 03:53:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 03:53:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 03:53:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-01-19 03:53:39,548 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-01-19 03:53:39,548 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-01-19 03:53:39,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-01-19 03:53:39,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:39,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-01-19 03:53:39,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 0 states have call successors, (0), 0 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 03:53:39,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 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 03:53:39,560 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 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 03:53:39,560 INFO L186 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-01-19 03:53:39,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-01-19 03:53:39,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:53:39,567 INFO L242 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-01-19 03:53:39,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-01-19 03:53:39,568 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-01-19 03:53:39,568 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-01-19 03:53:39,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 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 03:53:39,569 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:39,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:39,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:53:39,570 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-01-19 03:53:39,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:39,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530128566] [2022-01-19 03:53:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:39,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:39,678 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 03:53:39,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:39,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530128566] [2022-01-19 03:53:39,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530128566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:39,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:39,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:53:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076620831] [2022-01-19 03:53:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:53:39,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:53:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:53:39,682 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-01-19 03:53:39,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 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 03:53:39,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:39,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-01-19 03:53:39,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:39,714 INFO L129 PetriNetUnfolder]: 16/307 cut-off events. [2022-01-19 03:53:39,714 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 03:53:39,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-01-19 03:53:39,716 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-01-19 03:53:39,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-01-19 03:53:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:53:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:53:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-01-19 03:53:39,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-01-19 03:53:39,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:39,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 03:53:39,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:39,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:39,720 INFO L186 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-01-19 03:53:39,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-01-19 03:53:39,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-01-19 03:53:39,723 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-01-19 03:53:39,724 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-01-19 03:53:39,725 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-01-19 03:53:39,725 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-01-19 03:53:39,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 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 03:53:39,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:39,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:39,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 03:53:39,726 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-01-19 03:53:39,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:39,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325923690] [2022-01-19 03:53:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:39,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:39,796 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 03:53:39,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:39,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325923690] [2022-01-19 03:53:39,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325923690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:39,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:39,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:53:39,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99179741] [2022-01-19 03:53:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:39,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:53:39,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:53:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:53:39,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-01-19 03:53:39,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 03:53:39,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:39,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-01-19 03:53:39,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:39,854 INFO L129 PetriNetUnfolder]: 20/336 cut-off events. [2022-01-19 03:53:39,854 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:53:39,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 666 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-01-19 03:53:39,855 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-01-19 03:53:39,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-01-19 03:53:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:53:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:53:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-01-19 03:53:39,857 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-01-19 03:53:39,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:39,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-01-19 03:53:39,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 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 03:53:39,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:39,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:39,860 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-01-19 03:53:39,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-01-19 03:53:39,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 03:53:39,862 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-01-19 03:53:39,863 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-01-19 03:53:39,864 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-01-19 03:53:39,864 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-01-19 03:53:39,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 03:53:39,864 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:39,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:39,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 03:53:39,864 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:39,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-01-19 03:53:39,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:39,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657146948] [2022-01-19 03:53:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:39,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:39,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657146948] [2022-01-19 03:53:39,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657146948] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:53:39,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541770869] [2022-01-19 03:53:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:39,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:39,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:53:39,941 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 03:53:39,941 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 03:53:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:40,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:53:40,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:53:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:40,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:53:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:40,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541770869] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:53:40,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:53:40,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 03:53:40,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127132592] [2022-01-19 03:53:40,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:53:40,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 03:53:40,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 03:53:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 03:53:40,457 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-01-19 03:53:40,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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 03:53:40,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:40,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-01-19 03:53:40,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:40,531 INFO L129 PetriNetUnfolder]: 30/423 cut-off events. [2022-01-19 03:53:40,531 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-19 03:53:40,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 682 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-01-19 03:53:40,533 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-01-19 03:53:40,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-01-19 03:53:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 03:53:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 03:53:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-01-19 03:53:40,536 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-01-19 03:53:40,536 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-01-19 03:53:40,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-01-19 03:53:40,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:40,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-01-19 03:53:40,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 0 states have call successors, (0), 0 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 03:53:40,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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 03:53:40,543 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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 03:53:40,543 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-01-19 03:53:40,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-01-19 03:53:40,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:53:40,546 INFO L242 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-01-19 03:53:40,546 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-01-19 03:53:40,547 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-01-19 03:53:40,547 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-01-19 03:53:40,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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 03:53:40,548 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:40,548 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:40,583 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 03:53:40,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:40,784 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-01-19 03:53:40,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476500688] [2022-01-19 03:53:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:40,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-19 03:53:40,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476500688] [2022-01-19 03:53:40,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476500688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:53:40,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:53:40,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:53:40,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248989016] [2022-01-19 03:53:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:53:40,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:53:40,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:53:40,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:53:40,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-01-19 03:53:40,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 03:53:40,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:40,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-01-19 03:53:40,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:40,905 INFO L129 PetriNetUnfolder]: 25/611 cut-off events. [2022-01-19 03:53:40,906 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-01-19 03:53:40,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1299 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-01-19 03:53:40,908 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-01-19 03:53:40,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-01-19 03:53:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:53:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:53:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-01-19 03:53:40,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-01-19 03:53:40,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-01-19 03:53:40,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-01-19 03:53:40,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:40,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-01-19 03:53:40,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 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 03:53:40,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:40,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 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 03:53:40,912 INFO L186 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-01-19 03:53:40,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-01-19 03:53:40,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 03:53:40,915 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-01-19 03:53:40,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-01-19 03:53:40,916 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-01-19 03:53:40,916 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-01-19 03:53:40,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 03:53:40,917 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:40,917 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:40,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 03:53:40,917 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -733343356, now seen corresponding path program 1 times [2022-01-19 03:53:40,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098126155] [2022-01-19 03:53:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:40,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:41,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098126155] [2022-01-19 03:53:41,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098126155] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:53:41,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426082589] [2022-01-19 03:53:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:41,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:53:41,004 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 03:53:41,005 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 03:53:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:41,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 03:53:41,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:53:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:41,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:53:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:41,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426082589] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:53:41,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:53:41,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 03:53:41,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669672971] [2022-01-19 03:53:41,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:53:41,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 03:53:41,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:41,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 03:53:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 03:53:41,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-01-19 03:53:41,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 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 03:53:41,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:41,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-01-19 03:53:41,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:41,983 INFO L129 PetriNetUnfolder]: 58/747 cut-off events. [2022-01-19 03:53:41,983 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-01-19 03:53:41,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1380 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-01-19 03:53:41,986 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-01-19 03:53:41,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-01-19 03:53:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 03:53:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 03:53:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-01-19 03:53:41,992 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-01-19 03:53:41,992 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-01-19 03:53:41,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-01-19 03:53:41,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:41,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-01-19 03:53:42,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 0 states have call successors, (0), 0 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 03:53:42,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 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 03:53:42,008 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 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 03:53:42,009 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-01-19 03:53:42,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-01-19 03:53:42,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:53:42,014 INFO L242 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-01-19 03:53:42,015 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-01-19 03:53:42,015 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-01-19 03:53:42,015 INFO L470 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-01-19 03:53:42,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 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 03:53:42,017 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:42,017 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:42,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 03:53:42,231 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,SelfDestructingSolverStorable6 [2022-01-19 03:53:42,232 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2142412128, now seen corresponding path program 2 times [2022-01-19 03:53:42,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:42,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135278937] [2022-01-19 03:53:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:42,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:42,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135278937] [2022-01-19 03:53:42,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135278937] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:53:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950268802] [2022-01-19 03:53:42,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:53:42,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:53:42,464 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 03:53:42,465 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 03:53:42,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 03:53:42,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:53:42,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 03:53:42,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:53:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:43,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:53:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:43,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950268802] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:53:43,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:53:43,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-01-19 03:53:43,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736068343] [2022-01-19 03:53:43,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:53:43,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 03:53:43,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 03:53:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 03:53:43,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-01-19 03:53:43,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 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 03:53:43,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:43,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-01-19 03:53:43,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:53:44,413 INFO L129 PetriNetUnfolder]: 114/1393 cut-off events. [2022-01-19 03:53:44,413 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-01-19 03:53:44,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2793 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-01-19 03:53:44,419 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-01-19 03:53:44,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-01-19 03:53:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-19 03:53:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-19 03:53:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-01-19 03:53:44,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-01-19 03:53:44,432 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-01-19 03:53:44,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-01-19 03:53:44,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:53:44,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-01-19 03:53:44,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 0 states have call successors, (0), 0 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 03:53:44,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 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 03:53:44,460 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 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 03:53:44,460 INFO L186 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-01-19 03:53:44,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-01-19 03:53:44,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-01-19 03:53:44,466 INFO L242 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-01-19 03:53:44,466 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-01-19 03:53:44,466 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-01-19 03:53:44,466 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-01-19 03:53:44,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 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 03:53:44,468 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:53:44,469 INFO L254 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:44,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 03:53:44,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:44,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:53:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:53:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-01-19 03:53:44,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:53:44,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925474502] [2022-01-19 03:53:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:53:44,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:53:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:53:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:53:45,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:53:45,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925474502] [2022-01-19 03:53:45,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925474502] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:53:45,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366583795] [2022-01-19 03:53:45,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 03:53:45,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:53:45,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:53:45,162 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 03:53:45,163 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 03:53:45,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 03:53:45,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:53:45,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 03:53:45,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:53:46,969 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 13 treesize of output 9 [2022-01-19 03:53:47,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:53:47,039 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 16 treesize of output 18 [2022-01-19 03:53:47,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:53:47,208 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:53:47,209 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 03:53:47,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:53:47,257 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 23 treesize of output 22 [2022-01-19 03:53:47,282 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 19 treesize of output 7 [2022-01-19 03:53:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-01-19 03:53:47,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:53:55,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-19 03:53:55,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:53:55,719 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 22 treesize of output 23 [2022-01-19 03:53:55,733 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:53:55,733 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 36 treesize of output 39 [2022-01-19 03:53:55,740 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 11 treesize of output 7 [2022-01-19 03:53:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-01-19 03:53:56,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366583795] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:53:56,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:53:56,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-01-19 03:53:56,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938712083] [2022-01-19 03:53:56,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:53:56,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-19 03:53:56,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:53:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-19 03:53:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2291, Unknown=1, NotChecked=100, Total=2756 [2022-01-19 03:53:56,730 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-01-19 03:53:56,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 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 03:53:56,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:53:56,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-01-19 03:53:56,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:04,838 INFO L129 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-01-19 03:54:04,838 INFO L130 PetriNetUnfolder]: For 2826/2826 co-relation queries the response was YES. [2022-01-19 03:54:04,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7558 events. 2125/7558 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 39986 event pairs, 33 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-01-19 03:54:04,877 INFO L132 encePairwiseOnDemand]: 210/231 looper letters, 871 selfloop transitions, 372 changer transitions 0/1379 dead transitions. [2022-01-19 03:54:04,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1379 transitions, 6630 flow [2022-01-19 03:54:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-01-19 03:54:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2022-01-19 03:54:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 30418 transitions. [2022-01-19 03:54:04,904 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.727511898782617 [2022-01-19 03:54:04,904 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 30418 transitions. [2022-01-19 03:54:04,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 30418 transitions. [2022-01-19 03:54:04,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:04,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 30418 transitions. [2022-01-19 03:54:04,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 168.05524861878453) internal successors, (30418), 181 states have internal predecessors, (30418), 0 states have call successors, (0), 0 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 03:54:04,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 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 03:54:05,011 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 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 03:54:05,011 INFO L186 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 181 states and 30418 transitions. [2022-01-19 03:54:05,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1379 transitions, 6630 flow [2022-01-19 03:54:05,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1379 transitions, 6515 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-01-19 03:54:05,036 INFO L242 Difference]: Finished difference. Result has 515 places, 648 transitions, 3382 flow [2022-01-19 03:54:05,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=181, PETRI_FLOW=3382, PETRI_PLACES=515, PETRI_TRANSITIONS=648} [2022-01-19 03:54:05,038 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 302 predicate places. [2022-01-19 03:54:05,038 INFO L470 AbstractCegarLoop]: Abstraction has has 515 places, 648 transitions, 3382 flow [2022-01-19 03:54:05,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 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 03:54:05,040 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:05,040 INFO L254 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:05,059 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 03:54:05,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:05,258 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:54:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1049680381, now seen corresponding path program 1 times [2022-01-19 03:54:05,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:05,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171810257] [2022-01-19 03:54:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:05,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:05,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:05,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171810257] [2022-01-19 03:54:05,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171810257] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:54:05,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084481057] [2022-01-19 03:54:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:05,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:05,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:54:05,758 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 03:54:05,759 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 03:54:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:05,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-19 03:54:06,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:54:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:06,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:54:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:54:07,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084481057] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:54:07,817 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:54:07,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-01-19 03:54:07,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606730444] [2022-01-19 03:54:07,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:54:07,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-19 03:54:07,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-19 03:54:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-01-19 03:54:07,822 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-01-19 03:54:07,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 648 transitions, 3382 flow. Second operand has 43 states, 43 states have (on average 214.53488372093022) internal successors, (9225), 43 states have internal predecessors, (9225), 0 states have call successors, (0), 0 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 03:54:07,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:07,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-01-19 03:54:07,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:10,020 INFO L129 PetriNetUnfolder]: 589/5096 cut-off events. [2022-01-19 03:54:10,020 INFO L130 PetriNetUnfolder]: For 64991/64991 co-relation queries the response was YES. [2022-01-19 03:54:10,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16043 conditions, 5096 events. 589/5096 cut-off events. For 64991/64991 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 22845 event pairs, 7 based on Foata normal form. 24/5112 useless extension candidates. Maximal degree in co-relation 15950. Up to 316 conditions per place. [2022-01-19 03:54:10,057 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 105 selfloop transitions, 110 changer transitions 0/756 dead transitions. [2022-01-19 03:54:10,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 756 transitions, 4444 flow [2022-01-19 03:54:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 03:54:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 03:54:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12889 transitions. [2022-01-19 03:54:10,065 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92994227994228 [2022-01-19 03:54:10,065 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12889 transitions. [2022-01-19 03:54:10,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12889 transitions. [2022-01-19 03:54:10,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:10,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12889 transitions. [2022-01-19 03:54:10,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 214.81666666666666) internal successors, (12889), 60 states have internal predecessors, (12889), 0 states have call successors, (0), 0 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 03:54:10,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 231.0) internal successors, (14091), 61 states have internal predecessors, (14091), 0 states have call successors, (0), 0 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 03:54:10,086 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 231.0) internal successors, (14091), 61 states have internal predecessors, (14091), 0 states have call successors, (0), 0 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 03:54:10,086 INFO L186 Difference]: Start difference. First operand has 515 places, 648 transitions, 3382 flow. Second operand 60 states and 12889 transitions. [2022-01-19 03:54:10,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 756 transitions, 4444 flow [2022-01-19 03:54:10,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 756 transitions, 4264 flow, removed 4 selfloop flow, removed 45 redundant places. [2022-01-19 03:54:10,189 INFO L242 Difference]: Finished difference. Result has 534 places, 663 transitions, 3640 flow [2022-01-19 03:54:10,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3640, PETRI_PLACES=534, PETRI_TRANSITIONS=663} [2022-01-19 03:54:10,190 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 321 predicate places. [2022-01-19 03:54:10,190 INFO L470 AbstractCegarLoop]: Abstraction has has 534 places, 663 transitions, 3640 flow [2022-01-19 03:54:10,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 214.53488372093022) internal successors, (9225), 43 states have internal predecessors, (9225), 0 states have call successors, (0), 0 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 03:54:10,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:10,192 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:10,210 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 03:54:10,410 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,SelfDestructingSolverStorable9 [2022-01-19 03:54:10,410 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:54:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1622382637, now seen corresponding path program 2 times [2022-01-19 03:54:10,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:10,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366326951] [2022-01-19 03:54:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:10,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked. [2022-01-19 03:54:10,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:10,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366326951] [2022-01-19 03:54:10,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366326951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:54:10,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:54:10,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 03:54:10,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377497814] [2022-01-19 03:54:10,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:54:10,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 03:54:10,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 03:54:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-01-19 03:54:10,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-01-19 03:54:10,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 663 transitions, 3640 flow. Second operand has 17 states, 17 states have (on average 164.8235294117647) internal successors, (2802), 17 states have internal predecessors, (2802), 0 states have call successors, (0), 0 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 03:54:10,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:10,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-01-19 03:54:10,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:14,162 INFO L129 PetriNetUnfolder]: 2093/8378 cut-off events. [2022-01-19 03:54:14,162 INFO L130 PetriNetUnfolder]: For 90166/90166 co-relation queries the response was YES. [2022-01-19 03:54:14,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27693 conditions, 8378 events. 2093/8378 cut-off events. For 90166/90166 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 43708 event pairs, 1290 based on Foata normal form. 4/8347 useless extension candidates. Maximal degree in co-relation 27596. Up to 4581 conditions per place. [2022-01-19 03:54:14,223 INFO L132 encePairwiseOnDemand]: 214/231 looper letters, 405 selfloop transitions, 22 changer transitions 0/676 dead transitions. [2022-01-19 03:54:14,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 676 transitions, 4649 flow [2022-01-19 03:54:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 03:54:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 03:54:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2499 transitions. [2022-01-19 03:54:14,226 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2022-01-19 03:54:14,226 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2499 transitions. [2022-01-19 03:54:14,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2499 transitions. [2022-01-19 03:54:14,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:14,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2499 transitions. [2022-01-19 03:54:14,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 166.6) internal successors, (2499), 15 states have internal predecessors, (2499), 0 states have call successors, (0), 0 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 03:54:14,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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 03:54:14,231 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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 03:54:14,231 INFO L186 Difference]: Start difference. First operand has 534 places, 663 transitions, 3640 flow. Second operand 15 states and 2499 transitions. [2022-01-19 03:54:14,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 676 transitions, 4649 flow [2022-01-19 03:54:14,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 676 transitions, 4413 flow, removed 21 selfloop flow, removed 49 redundant places. [2022-01-19 03:54:14,356 INFO L242 Difference]: Finished difference. Result has 504 places, 667 transitions, 3625 flow [2022-01-19 03:54:14,357 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3372, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3625, PETRI_PLACES=504, PETRI_TRANSITIONS=667} [2022-01-19 03:54:14,357 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 291 predicate places. [2022-01-19 03:54:14,358 INFO L470 AbstractCegarLoop]: Abstraction has has 504 places, 667 transitions, 3625 flow [2022-01-19 03:54:14,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 164.8235294117647) internal successors, (2802), 17 states have internal predecessors, (2802), 0 states have call successors, (0), 0 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 03:54:14,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:14,358 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:14,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 03:54:14,358 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:54:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1679862554, now seen corresponding path program 3 times [2022-01-19 03:54:14,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:14,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962696232] [2022-01-19 03:54:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:14,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3769 proven. 89 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2022-01-19 03:54:15,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962696232] [2022-01-19 03:54:15,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962696232] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:54:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876200394] [2022-01-19 03:54:15,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 03:54:15,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:15,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:54:15,518 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 03:54:15,519 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 03:54:15,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-19 03:54:15,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:54:15,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-19 03:54:15,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:54:18,090 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 13 treesize of output 9 [2022-01-19 03:54:18,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:18,172 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 16 treesize of output 18 [2022-01-19 03:54:18,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:54:18,377 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:54:18,377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 03:54:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:18,427 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 23 treesize of output 22 [2022-01-19 03:54:18,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 15 [2022-01-19 03:54:18,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:18,662 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 18 treesize of output 20 [2022-01-19 03:54:18,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:54:18,837 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-01-19 03:54:18,837 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 29 [2022-01-19 03:54:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:18,879 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 25 treesize of output 24 [2022-01-19 03:54:18,925 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 21 treesize of output 9 [2022-01-19 03:54:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked. [2022-01-19 03:54:19,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:54:19,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-19 03:54:19,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-19 03:54:19,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-19 03:54:19,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-01-19 03:54:19,335 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-19 03:54:19,343 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_1665 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-01-19 03:54:19,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 20) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) is different from false [2022-01-19 03:54:19,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 20) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))) is different from false [2022-01-19 03:54:19,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= 20 .cse0) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))))) is different from false [2022-01-19 03:54:19,510 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 20) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2)))))))) is different from false [2022-01-19 03:54:19,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse1) 20) (= 20 .cse3)))))) is different from false [2022-01-19 03:54:19,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (= .cse3 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse2))))))))) is different from false [2022-01-19 03:54:19,905 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:19,906 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 151 treesize of output 111 [2022-01-19 03:54:19,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:19,912 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 171 treesize of output 171 [2022-01-19 03:54:19,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:54:19,923 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 116 treesize of output 104 [2022-01-19 03:54:19,927 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 91 treesize of output 83 [2022-01-19 03:54:20,462 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 8 treesize of output 4 [2022-01-19 03:54:20,475 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:20,475 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 198 treesize of output 194 [2022-01-19 03:54:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 411 refuted. 0 times theorem prover too weak. 4318 trivial. 698 not checked. [2022-01-19 03:54:21,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876200394] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:54:21,630 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:54:21,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 23] total 59 [2022-01-19 03:54:21,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890141629] [2022-01-19 03:54:21,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:54:21,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-19 03:54:21,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-19 03:54:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1893, Unknown=12, NotChecked=1212, Total=3422 [2022-01-19 03:54:21,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 231 [2022-01-19 03:54:21,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 667 transitions, 3625 flow. Second operand has 59 states, 59 states have (on average 167.76271186440678) internal successors, (9898), 59 states have internal predecessors, (9898), 0 states have call successors, (0), 0 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 03:54:21,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:21,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 231 [2022-01-19 03:54:21,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:22,369 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (= .cse3 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse2))))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:22,727 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse1 .cse2))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (= 20 .cse4)))))) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:54:23,097 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 20) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse2)))))))) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:25,127 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (= 20 .cse0) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:26,784 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (= .cse3 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse2))))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:27,153 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|) .cse2) 20) (= .cse3 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse2))))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:38,089 INFO L129 PetriNetUnfolder]: 7212/29143 cut-off events. [2022-01-19 03:54:38,089 INFO L130 PetriNetUnfolder]: For 430689/430706 co-relation queries the response was YES. [2022-01-19 03:54:38,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97859 conditions, 29143 events. 7212/29143 cut-off events. For 430689/430706 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 232088 event pairs, 1260 based on Foata normal form. 122/28989 useless extension candidates. Maximal degree in co-relation 97759. Up to 3533 conditions per place. [2022-01-19 03:54:38,522 INFO L132 encePairwiseOnDemand]: 203/231 looper letters, 826 selfloop transitions, 759 changer transitions 0/1834 dead transitions. [2022-01-19 03:54:38,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 1834 transitions, 12753 flow [2022-01-19 03:54:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 03:54:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 03:54:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 7031 transitions. [2022-01-19 03:54:38,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7423714496885229 [2022-01-19 03:54:38,526 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 7031 transitions. [2022-01-19 03:54:38,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 7031 transitions. [2022-01-19 03:54:38,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:54:38,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 7031 transitions. [2022-01-19 03:54:38,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 171.4878048780488) internal successors, (7031), 41 states have internal predecessors, (7031), 0 states have call successors, (0), 0 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 03:54:38,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 231.0) internal successors, (9702), 42 states have internal predecessors, (9702), 0 states have call successors, (0), 0 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 03:54:38,539 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 231.0) internal successors, (9702), 42 states have internal predecessors, (9702), 0 states have call successors, (0), 0 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 03:54:38,539 INFO L186 Difference]: Start difference. First operand has 504 places, 667 transitions, 3625 flow. Second operand 41 states and 7031 transitions. [2022-01-19 03:54:38,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 1834 transitions, 12753 flow [2022-01-19 03:54:38,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 1834 transitions, 12600 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-01-19 03:54:38,985 INFO L242 Difference]: Finished difference. Result has 566 places, 1363 transitions, 10259 flow [2022-01-19 03:54:38,986 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3474, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10259, PETRI_PLACES=566, PETRI_TRANSITIONS=1363} [2022-01-19 03:54:38,986 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 353 predicate places. [2022-01-19 03:54:38,986 INFO L470 AbstractCegarLoop]: Abstraction has has 566 places, 1363 transitions, 10259 flow [2022-01-19 03:54:38,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 167.76271186440678) internal successors, (9898), 59 states have internal predecessors, (9898), 0 states have call successors, (0), 0 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 03:54:38,987 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:54:38,987 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:39,006 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 03:54:39,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:39,189 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:54:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:54:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2033337717, now seen corresponding path program 1 times [2022-01-19 03:54:39,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:54:39,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627721355] [2022-01-19 03:54:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:39,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:54:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2579 proven. 139 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2022-01-19 03:54:40,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:54:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627721355] [2022-01-19 03:54:40,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627721355] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:54:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208368389] [2022-01-19 03:54:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:54:40,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:54:40,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:54:40,260 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 03:54:40,261 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 03:54:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:54:40,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-19 03:54:40,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:54:41,070 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 13 treesize of output 9 [2022-01-19 03:54:41,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:41,131 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 16 treesize of output 18 [2022-01-19 03:54:41,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:54:41,300 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:54:41,300 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 03:54:41,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:41,343 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 23 treesize of output 22 [2022-01-19 03:54:41,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 15 [2022-01-19 03:54:41,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:54:41,556 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 16 treesize of output 18 [2022-01-19 03:54:41,695 INFO L353 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-01-19 03:54:41,695 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 3 case distinctions, treesize of input 31 treesize of output 30 [2022-01-19 03:54:41,716 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-19 03:54:41,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-19 03:54:41,728 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 19 treesize of output 7 [2022-01-19 03:54:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1932 proven. 72 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2022-01-19 03:54:42,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:54:43,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1)) 20))) is different from false [2022-01-19 03:54:43,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1)) 20))) is different from false [2022-01-19 03:54:43,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2057)) .cse1))))) is different from false [2022-01-19 03:54:43,128 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2057)) .cse1)) 20))) is different from false [2022-01-19 03:54:43,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1)) 20))) is different from false [2022-01-19 03:54:43,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2051 Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1))))) is different from false [2022-01-19 03:54:43,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2051 Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2057)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-01-19 03:54:43,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse3)) 20))))) is different from false [2022-01-19 03:54:43,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1) 20))))) is different from false [2022-01-19 03:54:43,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) is different from false [2022-01-19 03:54:43,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:43,387 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 215 treesize of output 155 [2022-01-19 03:54:43,393 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:43,393 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 247 treesize of output 245 [2022-01-19 03:54:43,396 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 834 treesize of output 806 [2022-01-19 03:54:43,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 829 treesize of output 805 [2022-01-19 03:54:43,429 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 8 treesize of output 4 [2022-01-19 03:54:43,455 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:54:43,456 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 701 treesize of output 681 [2022-01-19 03:54:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1871 proven. 43 refuted. 0 times theorem prover too weak. 3886 trivial. 90 not checked. [2022-01-19 03:54:43,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208368389] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:54:43,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:54:43,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 22] total 60 [2022-01-19 03:54:43,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157953964] [2022-01-19 03:54:43,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:54:43,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-19 03:54:43,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:54:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-19 03:54:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2167, Unknown=10, NotChecked=1050, Total=3540 [2022-01-19 03:54:43,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-01-19 03:54:43,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 1363 transitions, 10259 flow. Second operand has 60 states, 60 states have (on average 165.73333333333332) internal successors, (9944), 60 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 03:54:43,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:54:43,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-01-19 03:54:43,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:54:44,587 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:45,067 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:45,428 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:45,802 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse2) 20))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:54:46,149 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1) 20))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:46,606 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse1) 20)))))) is different from false [2022-01-19 03:54:46,981 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse3)) 20))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:49,039 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2051 Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2057)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:49,442 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse3)) 20)))))) is different from false [2022-01-19 03:54:49,820 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2057)) .cse3)) 20))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:51,991 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2051 Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2057)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))))) is different from false [2022-01-19 03:54:53,996 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2051 Int) (v_ArrVal_2053 Int) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2057)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:56,949 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:57,334 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:54:57,814 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1)))))))) is different from false [2022-01-19 03:55:04,226 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2051 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2053 Int) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2057 Int) (v_ArrVal_2056 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2051) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2057)) .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:57:33,326 WARN L228 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 63 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 03:58:12,876 INFO L129 PetriNetUnfolder]: 11976/58484 cut-off events. [2022-01-19 03:58:12,877 INFO L130 PetriNetUnfolder]: For 1001022/1002012 co-relation queries the response was YES. [2022-01-19 03:58:13,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274386 conditions, 58484 events. 11976/58484 cut-off events. For 1001022/1002012 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 575242 event pairs, 1821 based on Foata normal form. 346/58254 useless extension candidates. Maximal degree in co-relation 274257. Up to 9767 conditions per place. [2022-01-19 03:58:13,815 INFO L132 encePairwiseOnDemand]: 201/231 looper letters, 1333 selfloop transitions, 2098 changer transitions 0/3678 dead transitions. [2022-01-19 03:58:13,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 3678 transitions, 36786 flow [2022-01-19 03:58:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-01-19 03:58:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2022-01-19 03:58:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 19767 transitions. [2022-01-19 03:58:13,829 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.725181598062954 [2022-01-19 03:58:13,829 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 19767 transitions. [2022-01-19 03:58:13,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 19767 transitions. [2022-01-19 03:58:13,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:58:13,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 19767 transitions. [2022-01-19 03:58:13,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 167.51694915254237) internal successors, (19767), 118 states have internal predecessors, (19767), 0 states have call successors, (0), 0 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 03:58:13,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 231.0) internal successors, (27489), 119 states have internal predecessors, (27489), 0 states have call successors, (0), 0 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 03:58:13,877 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 231.0) internal successors, (27489), 119 states have internal predecessors, (27489), 0 states have call successors, (0), 0 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 03:58:13,877 INFO L186 Difference]: Start difference. First operand has 566 places, 1363 transitions, 10259 flow. Second operand 118 states and 19767 transitions. [2022-01-19 03:58:13,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 3678 transitions, 36786 flow [2022-01-19 03:58:15,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 3678 transitions, 36236 flow, removed 252 selfloop flow, removed 7 redundant places. [2022-01-19 03:58:15,386 INFO L242 Difference]: Finished difference. Result has 735 places, 2662 transitions, 28257 flow [2022-01-19 03:58:15,387 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=10029, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=835, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=28257, PETRI_PLACES=735, PETRI_TRANSITIONS=2662} [2022-01-19 03:58:15,387 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 522 predicate places. [2022-01-19 03:58:15,387 INFO L470 AbstractCegarLoop]: Abstraction has has 735 places, 2662 transitions, 28257 flow [2022-01-19 03:58:15,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 165.73333333333332) internal successors, (9944), 60 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 03:58:15,388 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:58:15,389 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:15,407 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 03:58:15,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:58:15,603 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 03:58:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:58:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1596726434, now seen corresponding path program 4 times [2022-01-19 03:58:15,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:58:15,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005249585] [2022-01-19 03:58:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:58:15,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:58:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:58:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 1467 proven. 75 refuted. 0 times theorem prover too weak. 4440 trivial. 0 not checked. [2022-01-19 03:58:16,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:58:16,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005249585] [2022-01-19 03:58:16,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005249585] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:58:16,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566905117] [2022-01-19 03:58:16,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 03:58:16,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:58:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:58:16,558 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 03:58:16,558 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 03:58:24,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 03:58:24,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:58:24,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-19 03:58:24,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:58:25,390 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 13 treesize of output 9 [2022-01-19 03:58:25,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:25,433 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 16 treesize of output 18 [2022-01-19 03:58:25,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:58:25,602 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:58:25,603 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 03:58:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:25,642 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 23 treesize of output 22 [2022-01-19 03:58:25,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 15 [2022-01-19 03:58:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:25,809 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 18 treesize of output 20 [2022-01-19 03:58:25,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:58:26,000 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:58:26,000 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-19 03:58:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:26,036 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 25 treesize of output 24 [2022-01-19 03:58:26,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 17 [2022-01-19 03:58:26,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:26,233 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 16 treesize of output 18 [2022-01-19 03:58:26,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:58:26,377 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 03:58:26,377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 03:58:26,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 03:58:26,419 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 23 treesize of output 22 [2022-01-19 03:58:26,435 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 19 treesize of output 7 [2022-01-19 03:58:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 3563 proven. 228 refuted. 0 times theorem prover too weak. 2191 trivial. 0 not checked. [2022-01-19 03:58:26,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:58:50,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))) is different from false [2022-01-19 03:58:50,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-01-19 03:58:50,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))) is different from false [2022-01-19 03:58:50,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-01-19 03:58:50,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2450)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-01-19 03:58:50,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2450)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-01-19 03:58:50,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2450)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))))) is different from false [2022-01-19 03:58:50,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse3))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse3))))))) is different from false [2022-01-19 03:58:50,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))))))) is different from false [2022-01-19 03:58:50,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) is different from false [2022-01-19 03:58:51,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) is different from false [2022-01-19 03:58:51,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))))) is different from false [2022-01-19 03:58:51,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))))) is different from false [2022-01-19 03:58:51,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2443)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1)))))))) is different from false [2022-01-19 03:58:51,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2443)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1)))))))) is different from false [2022-01-19 03:58:51,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2443)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-01-19 03:58:51,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2443))) (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse4))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)))))))) is different from false [2022-01-19 03:58:51,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1))))))))) is different from false [2022-01-19 03:58:52,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) is different from false [2022-01-19 03:58:52,761 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:58:52,761 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 739 treesize of output 529 [2022-01-19 03:58:52,775 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:58:52,776 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 873 treesize of output 863 [2022-01-19 03:58:52,787 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 1696 treesize of output 1680 [2022-01-19 03:58:52,841 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 1584 treesize of output 1552 [2022-01-19 03:58:52,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 03:58:52,852 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 1814 treesize of output 1790 [2022-01-19 03:58:52,900 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 8 treesize of output 4 [2022-01-19 03:58:53,151 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 03:58:53,152 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 823 treesize of output 807 [2022-01-19 03:58:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 3167 proven. 135 refuted. 0 times theorem prover too weak. 2191 trivial. 489 not checked. [2022-01-19 03:58:53,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566905117] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:58:53,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:58:53,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 31] total 80 [2022-01-19 03:58:53,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570314480] [2022-01-19 03:58:53,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:58:53,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-01-19 03:58:53,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:58:53,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-01-19 03:58:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=3227, Unknown=46, NotChecked=2584, Total=6320 [2022-01-19 03:58:53,813 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 231 [2022-01-19 03:58:53,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 2662 transitions, 28257 flow. Second operand has 80 states, 80 states have (on average 160.6875) internal successors, (12855), 80 states have internal predecessors, (12855), 0 states have call successors, (0), 0 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 03:58:53,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:58:53,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 231 [2022-01-19 03:58:53,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:58:55,777 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:58:56,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= (* (select .cse0 84) 4) 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse7 v_ArrVal_2443))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse1 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse7 v_ArrVal_2450))) (store .cse6 .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse2))) (not (= 20 (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse4 .cse2))))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:58:57,202 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2443))) (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse4))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:58:59,272 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2443)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 7 |c_~#queue~0.base|) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:00,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (= (+ (- 1) (select .cse5 (+ 84 |c_~#queue~0.offset|))) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= (select .cse5 84) 2) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:59:01,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (= (+ (- 1) (select .cse5 (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (<= (select .cse5 84) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:59:02,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (+ (- 1) (select .cse0 (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse1 .cse2))) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse2))))))) (<= (select .cse0 84) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-01-19 03:59:03,322 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 8) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse3))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse3))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:05,417 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2450)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))))) (= 7 |c_~#queue~0.base|) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 8 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:08,209 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 8) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) 84) 2) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2454 Int)) (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2454) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20))))) (= 7 |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:09,323 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:09,810 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:12,318 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 4) 4) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:14,255 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:15,320 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1))))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:16,242 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2443))) (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse4))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:18,323 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2441) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2443)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:21,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:22,229 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:22,894 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 4) (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:23,968 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2450))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:25,007 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2450))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse3))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse3))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:27,293 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2450 Int) (v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2448) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2450)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:29,318 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|))) (forall ((v_ArrVal_2454 Int) (v_ArrVal_2453 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (not (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 03:59:41,655 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2450 Int) (v_ArrVal_2441 Int) (v_ArrVal_2446 (Array Int Int)) (v_ArrVal_2443 Int) (v_ArrVal_2454 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2448 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2439))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2441) .cse6 v_ArrVal_2443))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2446))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2448) .cse6 v_ArrVal_2450))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2453) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2454) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-01-19 04:00:58,118 INFO L129 PetriNetUnfolder]: 22988/118734 cut-off events. [2022-01-19 04:00:58,118 INFO L130 PetriNetUnfolder]: For 2813049/2815561 co-relation queries the response was YES. [2022-01-19 04:01:01,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 669772 conditions, 118734 events. 22988/118734 cut-off events. For 2813049/2815561 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 1390504 event pairs, 7770 based on Foata normal form. 537/117896 useless extension candidates. Maximal degree in co-relation 669584. Up to 19424 conditions per place. [2022-01-19 04:01:01,839 INFO L132 encePairwiseOnDemand]: 199/231 looper letters, 2123 selfloop transitions, 3060 changer transitions 0/5428 dead transitions. [2022-01-19 04:01:01,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 5428 transitions, 72924 flow [2022-01-19 04:01:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-01-19 04:01:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2022-01-19 04:01:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 21384 transitions. [2022-01-19 04:01:01,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7066521264994547 [2022-01-19 04:01:01,873 INFO L72 ComplementDD]: Start complementDD. Operand 131 states and 21384 transitions. [2022-01-19 04:01:01,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 21384 transitions. [2022-01-19 04:01:01,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:01:01,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 131 states and 21384 transitions. [2022-01-19 04:01:01,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 132 states, 131 states have (on average 163.23664122137404) internal successors, (21384), 131 states have internal predecessors, (21384), 0 states have call successors, (0), 0 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:01:01,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 132 states, 132 states have (on average 231.0) internal successors, (30492), 132 states have internal predecessors, (30492), 0 states have call successors, (0), 0 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:01:01,917 INFO L81 ComplementDD]: Finished complementDD. Result has 132 states, 132 states have (on average 231.0) internal successors, (30492), 132 states have internal predecessors, (30492), 0 states have call successors, (0), 0 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:01:01,918 INFO L186 Difference]: Start difference. First operand has 735 places, 2662 transitions, 28257 flow. Second operand 131 states and 21384 transitions. [2022-01-19 04:01:01,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 5428 transitions, 72924 flow [2022-01-19 04:01:10,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 5428 transitions, 69581 flow, removed 1438 selfloop flow, removed 16 redundant places. [2022-01-19 04:01:10,812 INFO L242 Difference]: Finished difference. Result has 940 places, 4556 transitions, 59875 flow [2022-01-19 04:01:10,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=24895, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=59875, PETRI_PLACES=940, PETRI_TRANSITIONS=4556} [2022-01-19 04:01:10,815 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 727 predicate places. [2022-01-19 04:01:10,815 INFO L470 AbstractCegarLoop]: Abstraction has has 940 places, 4556 transitions, 59875 flow [2022-01-19 04:01:10,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 160.6875) internal successors, (12855), 80 states have internal predecessors, (12855), 0 states have call successors, (0), 0 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:01:10,816 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:01:10,817 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:10,828 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:01:11,026 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,SelfDestructingSolverStorable13 [2022-01-19 04:01:11,027 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 04:01:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:01:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1742224215, now seen corresponding path program 2 times [2022-01-19 04:01:11,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:01:11,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335195424] [2022-01-19 04:01:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:01:11,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:01:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:01:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 3040 proven. 289 refuted. 0 times theorem prover too weak. 2653 trivial. 0 not checked. [2022-01-19 04:01:12,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:01:12,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335195424] [2022-01-19 04:01:12,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335195424] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:01:12,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513674170] [2022-01-19 04:01:12,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:01:12,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:01:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:01:12,032 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:01:12,067 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:01:12,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:01:12,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:01:12,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-19 04:01:12,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:01:12,560 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:01:12,562 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:01:12,594 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 04:01:12,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 04:01:12,742 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 13 treesize of output 9 [2022-01-19 04:01:12,786 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-01-19 04:01:12,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-19 04:01:13,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 04:01:13,097 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 16 treesize of output 18 [2022-01-19 04:01:13,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:01:13,257 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 04:01:13,257 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 04:01:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:01:13,295 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 23 treesize of output 22 [2022-01-19 04:01:13,312 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 19 treesize of output 7 [2022-01-19 04:01:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5601 trivial. 0 not checked. [2022-01-19 04:01:14,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:01:14,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513674170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:01:14,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:01:14,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [24] total 39 [2022-01-19 04:01:14,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750709496] [2022-01-19 04:01:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:01:14,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 04:01:14,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:01:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 04:01:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2022-01-19 04:01:14,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 231 [2022-01-19 04:01:14,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 4556 transitions, 59875 flow. Second operand has 17 states, 17 states have (on average 155.35294117647058) internal successors, (2641), 17 states have internal predecessors, (2641), 0 states have call successors, (0), 0 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:01:14,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:01:14,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 231 [2022-01-19 04:01:14,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:03:35,650 INFO L129 PetriNetUnfolder]: 20647/113133 cut-off events. [2022-01-19 04:03:35,650 INFO L130 PetriNetUnfolder]: For 6615964/6619592 co-relation queries the response was YES. [2022-01-19 04:03:40,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905540 conditions, 113133 events. 20647/113133 cut-off events. For 6615964/6619592 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 1339973 event pairs, 11872 based on Foata normal form. 158/112001 useless extension candidates. Maximal degree in co-relation 905262. Up to 54438 conditions per place. [2022-01-19 04:03:41,318 INFO L132 encePairwiseOnDemand]: 215/231 looper letters, 4121 selfloop transitions, 27 changer transitions 0/4442 dead transitions. [2022-01-19 04:03:41,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 4442 transitions, 67181 flow [2022-01-19 04:03:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:03:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:03:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2362 transitions. [2022-01-19 04:03:41,320 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6816738816738817 [2022-01-19 04:03:41,320 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2362 transitions. [2022-01-19 04:03:41,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2362 transitions. [2022-01-19 04:03:41,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:03:41,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2362 transitions. [2022-01-19 04:03:41,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 157.46666666666667) internal successors, (2362), 15 states have internal predecessors, (2362), 0 states have call successors, (0), 0 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:03:41,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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:03:41,324 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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:03:41,324 INFO L186 Difference]: Start difference. First operand has 940 places, 4556 transitions, 59875 flow. Second operand 15 states and 2362 transitions. [2022-01-19 04:03:41,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 4442 transitions, 67181 flow [2022-01-19 04:04:01,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 4442 transitions, 65125 flow, removed 1005 selfloop flow, removed 17 redundant places. [2022-01-19 04:04:01,116 INFO L242 Difference]: Finished difference. Result has 934 places, 4426 transitions, 56382 flow [2022-01-19 04:04:01,119 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=56084, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=56382, PETRI_PLACES=934, PETRI_TRANSITIONS=4426} [2022-01-19 04:04:01,119 INFO L334 CegarLoopForPetriNet]: 213 programPoint places, 721 predicate places. [2022-01-19 04:04:01,120 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 4426 transitions, 56382 flow [2022-01-19 04:04:01,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 155.35294117647058) internal successors, (2641), 17 states have internal predecessors, (2641), 0 states have call successors, (0), 0 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:04:01,120 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:04:01,121 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 13, 13, 13, 13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:01,143 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:04:01,339 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,SelfDestructingSolverStorable14 [2022-01-19 04:04:01,339 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 04:04:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:04:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -652461515, now seen corresponding path program 5 times [2022-01-19 04:04:01,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:04:01,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291848401] [2022-01-19 04:04:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:04:01,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:04:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:04:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1479 proven. 75 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2022-01-19 04:04:03,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:04:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291848401] [2022-01-19 04:04:03,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291848401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:04:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376304780] [2022-01-19 04:04:03,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 04:04:03,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:04:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:04:03,346 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:04:03,357 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:04:05,264 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-19 04:04:05,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:04:05,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 131 conjunts are in the unsatisfiable core [2022-01-19 04:04:05,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:04:05,547 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 13 treesize of output 9 [2022-01-19 04:04:05,592 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-01-19 04:04:05,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 38 [2022-01-19 04:04:05,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:04:05,964 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-19 04:04:05,964 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 63 [2022-01-19 04:04:06,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:06,062 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 49 treesize of output 48 [2022-01-19 04:04:06,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 44 [2022-01-19 04:04:06,401 INFO L353 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-01-19 04:04:06,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 51 treesize of output 64 [2022-01-19 04:04:06,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:04:06,886 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-19 04:04:06,886 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 63 [2022-01-19 04:04:07,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:07,021 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 49 treesize of output 48 [2022-01-19 04:04:07,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 13 [2022-01-19 04:04:07,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:07,323 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 25 treesize of output 24 [2022-01-19 04:04:07,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:04:07,645 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 04:04:07,645 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 04:04:07,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:07,707 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 23 treesize of output 22 [2022-01-19 04:04:07,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 15 [2022-01-19 04:04:08,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:08,012 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 27 treesize of output 26 [2022-01-19 04:04:08,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:04:08,396 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 04:04:08,396 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2022-01-19 04:04:08,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:08,462 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 25 treesize of output 24 [2022-01-19 04:04:08,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 17 [2022-01-19 04:04:08,799 INFO L353 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-01-19 04:04:08,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 32 treesize of output 31 [2022-01-19 04:04:08,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:04:08,998 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-19 04:04:08,999 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-01-19 04:04:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:04:09,027 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 23 treesize of output 22 [2022-01-19 04:04:09,045 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 19 treesize of output 7 [2022-01-19 04:04:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 3587 proven. 184 refuted. 0 times theorem prover too weak. 2269 trivial. 0 not checked. [2022-01-19 04:04:09,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:05:03,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 Int) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_3257)) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| 4) |c_~#queue~0.offset|) v_ArrVal_3260) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| (select .cse0 .cse1)))))) is different from false [2022-01-19 04:05:04,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 Int) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_3257))) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| 4) |c_~#queue~0.offset|) v_ArrVal_3260) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| (select .cse0 .cse1)))))) is different from false [2022-01-19 04:05:06,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 Int) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_3257))) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| 4) |c_~#queue~0.offset|) v_ArrVal_3260) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| (select .cse0 .cse1)))))) is different from false [2022-01-19 04:05:07,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3260 Int) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| Int)) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_3257))) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| 4) |c_~#queue~0.offset|) v_ArrVal_3260) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_358| (select .cse0 .cse1)))))) is different from false Received shutdown request... [2022-01-19 04:05:55,718 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:05:55,718 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 04:05:56,753 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:05:56,779 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 04:05:56,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 04:05:56,780 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 805 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-01-19 04:05:56,780 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-19 04:05:56,781 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 04:05:56,781 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 04:05:56,781 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-19 04:05:56,783 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1] [2022-01-19 04:05:56,785 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:05:56,785 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:05:56,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:05:56 BasicIcfg [2022-01-19 04:05:56,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:05:56,787 INFO L158 Benchmark]: Toolchain (without parser) took 739549.53ms. Allocated memory was 377.5MB in the beginning and 12.3GB in the end (delta: 11.9GB). Free memory was 321.7MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2022-01-19 04:05:56,787 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 377.5MB. Free memory is still 340.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:05:56,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.39ms. Allocated memory was 377.5MB in the beginning and 467.7MB in the end (delta: 90.2MB). Free memory was 321.5MB in the beginning and 422.4MB in the end (delta: -100.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.0GB. [2022-01-19 04:05:56,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 467.7MB. Free memory was 422.4MB in the beginning and 419.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 04:05:56,788 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 467.7MB. Free memory was 419.2MB in the beginning and 417.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:05:56,788 INFO L158 Benchmark]: RCFGBuilder took 358.44ms. Allocated memory is still 467.7MB. Free memory was 417.1MB in the beginning and 397.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 04:05:56,788 INFO L158 Benchmark]: TraceAbstraction took 738723.65ms. Allocated memory was 467.7MB in the beginning and 12.3GB in the end (delta: 11.9GB). Free memory was 397.2MB in the beginning and 5.2GB in the end (delta: -4.8GB). Peak memory consumption was 7.1GB. Max. memory is 16.0GB. [2022-01-19 04:05:56,789 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 377.5MB. Free memory is still 340.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 390.39ms. Allocated memory was 377.5MB in the beginning and 467.7MB in the end (delta: 90.2MB). Free memory was 321.5MB in the beginning and 422.4MB in the end (delta: -100.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 467.7MB. Free memory was 422.4MB in the beginning and 419.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 467.7MB. Free memory was 419.2MB in the beginning and 417.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 358.44ms. Allocated memory is still 467.7MB. Free memory was 417.1MB in the beginning and 397.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 738723.65ms. Allocated memory was 467.7MB in the beginning and 12.3GB in the end (delta: 11.9GB). Free memory was 397.2MB in the beginning and 5.2GB in the end (delta: -4.8GB). Peak memory consumption was 7.1GB. 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 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 805 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 805 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 805 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 805 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 738.5s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 549.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10087 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10087 mSDsluCounter, 4122 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15043 IncrementalHoareTripleChecker+Unchecked, 4271 mSDsCounter, 1597 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11640 IncrementalHoareTripleChecker+Invalid, 28280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1597 mSolverCounterUnsat, 417 mSDtfsCounter, 11640 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10736 GetRequests, 9644 SyntacticMatches, 136 SemanticMatches, 956 ConstructedPredicates, 89 IntricatePredicates, 0 DeprecatedPredicates, 47701 ImplicationChecksByTransitivity, 253.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59875occurred in iteration=14, InterpolantAutomatonStates: 660, 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.5s SsaConstructionTime, 9.7s SatisfiabilityAnalysisTime, 60.5s InterpolantComputationTime, 11800 NumberOfCodeBlocks, 10833 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 16144 ConstructedInterpolants, 199 QuantifiedInterpolants, 86910 SizeOfPredicates, 153 NumberOfNonLiveVariables, 8981 ConjunctsInSsa, 384 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 73828/94359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown