/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 20:44:23,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 20:44:23,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 20:44:23,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 20:44:23,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 20:44:23,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 20:44:23,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 20:44:23,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 20:44:23,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 20:44:23,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 20:44:23,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 20:44:23,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 20:44:23,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 20:44:23,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 20:44:23,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 20:44:23,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 20:44:23,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 20:44:23,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 20:44:23,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 20:44:23,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 20:44:23,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 20:44:23,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 20:44:23,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 20:44:23,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 20:44:23,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 20:44:23,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 20:44:23,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 20:44:23,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 20:44:23,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 20:44:23,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 20:44:23,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 20:44:23,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 20:44:23,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 20:44:23,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 20:44:23,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 20:44:23,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 20:44:23,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 20:44:23,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 20:44:23,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 20:44:23,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 20:44:23,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 20:44:23,808 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-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf [2022-03-03 20:44:23,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 20:44:23,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 20:44:23,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 20:44:23,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 20:44:23,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 20:44:23,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 20:44:23,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 20:44:23,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 20:44:23,840 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 20:44:23,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 20:44:23,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 20:44:23,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 20:44:23,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 20:44:23,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 20:44:23,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-03 20:44:23,845 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-03 20:44:23,845 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-03-03 20:44:24,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 20:44:24,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 20:44:24,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 20:44:24,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 20:44:24,112 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 20:44:24,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-03-03 20:44:24,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79eb2fd4f/d44cccca192a4deeb805bf84f450fd6f/FLAG2763ddbc7 [2022-03-03 20:44:24,642 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 20:44:24,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-03-03 20:44:24,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79eb2fd4f/d44cccca192a4deeb805bf84f450fd6f/FLAG2763ddbc7 [2022-03-03 20:44:24,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79eb2fd4f/d44cccca192a4deeb805bf84f450fd6f [2022-03-03 20:44:24,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 20:44:24,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 20:44:24,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 20:44:24,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 20:44:24,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 20:44:24,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:44:24" (1/1) ... [2022-03-03 20:44:24,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be87e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:24, skipping insertion in model container [2022-03-03 20:44:24,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:44:24" (1/1) ... [2022-03-03 20:44:24,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 20:44:25,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 20:44:25,388 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-03-03 20:44:25,392 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-03-03 20:44:25,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 20:44:25,404 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 20:44:25,458 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-03-03 20:44:25,462 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-03-03 20:44:25,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 20:44:25,513 INFO L208 MainTranslator]: Completed translation [2022-03-03 20:44:25,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25 WrapperNode [2022-03-03 20:44:25,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 20:44:25,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 20:44:25,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 20:44:25,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 20:44:25,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,566 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-03-03 20:44:25,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 20:44:25,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 20:44:25,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 20:44:25,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 20:44:25,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 20:44:25,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 20:44:25,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 20:44:25,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 20:44:25,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (1/1) ... [2022-03-03 20:44:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 20:44:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:25,621 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-03-03 20:44:25,643 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-03-03 20:44:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-03 20:44:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-03 20:44:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-03 20:44:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-03 20:44:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 20:44:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 20:44:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 20:44:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 20:44:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 20:44:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 20:44:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 20:44:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 20:44:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 20:44:25,674 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 20:44:25,776 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 20:44:25,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 20:44:26,087 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 20:44:26,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 20:44:26,102 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-03 20:44:26,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 08:44:26 BoogieIcfgContainer [2022-03-03 20:44:26,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 20:44:26,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 20:44:26,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 20:44:26,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 20:44:26,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:44:24" (1/3) ... [2022-03-03 20:44:26,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159d1f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:44:26, skipping insertion in model container [2022-03-03 20:44:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:44:25" (2/3) ... [2022-03-03 20:44:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159d1f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:44:26, skipping insertion in model container [2022-03-03 20:44:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 08:44:26" (3/3) ... [2022-03-03 20:44:26,117 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-03-03 20:44:26,122 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 20:44:26,122 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 20:44:26,122 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-03 20:44:26,122 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 20:44:26,212 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,212 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,213 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,213 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,213 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,213 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,214 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,215 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,217 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,217 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,218 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,224 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,225 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,225 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,227 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,227 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,228 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,228 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,229 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,229 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,229 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,230 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,231 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,233 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,235 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,236 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,236 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,236 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,236 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,236 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,237 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,237 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,238 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,239 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,240 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,240 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,240 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,241 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,241 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,241 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,242 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,243 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,244 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,244 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,245 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,245 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,248 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,253 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,254 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,255 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,256 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,259 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,260 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,261 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,262 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,263 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,264 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,265 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,266 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,267 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,268 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,269 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,270 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,271 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,275 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,277 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,277 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,277 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,277 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,277 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,278 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,278 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,278 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,279 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,280 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,283 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,284 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,285 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,286 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,287 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,298 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,298 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,301 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,301 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,301 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,301 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,301 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,302 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,303 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,305 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,306 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,306 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,306 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,306 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,307 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,308 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,308 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,308 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,334 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,338 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,342 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,343 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,344 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,345 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,346 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,349 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,349 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,349 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,349 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,350 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,351 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,352 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,353 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 20:44:26,362 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-03 20:44:26,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-03 20:44:26,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:26,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-03 20:44:26,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-03 20:44:26,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 20:44:26,457 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=false [2022-03-03 20:44:26,458 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-03 20:44:26,523 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 62 transitions and produced 63 states. [2022-03-03 20:44:26,525 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-03-03 20:44:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2068546759, now seen corresponding path program 1 times [2022-03-03 20:44:26,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:26,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663433906] [2022-03-03 20:44:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:26,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:26,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663433906] [2022-03-03 20:44:26,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663433906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:44:26,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 20:44:26,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 20:44:26,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393272844] [2022-03-03 20:44:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:44:26,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 20:44:26,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 20:44:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 20:44:26,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:26,807 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:26,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:26,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:26,933 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 197 transitions and produced 198 states. [2022-03-03 20:44:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:26,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 20:44:26,939 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-03-03 20:44:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1753186365, now seen corresponding path program 1 times [2022-03-03 20:44:26,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:26,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658385526] [2022-03-03 20:44:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:27,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:27,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658385526] [2022-03-03 20:44:27,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658385526] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:44:27,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 20:44:27,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 20:44:27,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525110871] [2022-03-03 20:44:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:44:27,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 20:44:27,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:27,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 20:44:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 20:44:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,189 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:27,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:27,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,268 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 220 transitions and produced 212 states. [2022-03-03 20:44:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:27,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 20:44:27,270 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-03-03 20:44:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1422445204, now seen corresponding path program 1 times [2022-03-03 20:44:27,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:27,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166398387] [2022-03-03 20:44:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:27,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:27,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166398387] [2022-03-03 20:44:27,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166398387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:44:27,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 20:44:27,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 20:44:27,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892549470] [2022-03-03 20:44:27,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:44:27,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 20:44:27,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 20:44:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 20:44:27,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,389 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:27,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:27,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:27,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,452 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 285 transitions and produced 246 states. [2022-03-03 20:44:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:27,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 20:44:27,456 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-03-03 20:44:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1078166552, now seen corresponding path program 1 times [2022-03-03 20:44:27,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:27,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561814239] [2022-03-03 20:44:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:27,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:27,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561814239] [2022-03-03 20:44:27,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561814239] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:44:27,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914535127] [2022-03-03 20:44:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:27,594 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-03-03 20:44:27,600 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-03-03 20:44:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:27,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 20:44:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:44:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:28,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:44:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:28,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914535127] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:44:28,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:44:28,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 20:44:28,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925211488] [2022-03-03 20:44:28,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:44:28,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 20:44:28,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 20:44:28,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 20:44:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:28,547 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:28,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:28,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:28,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:28,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:28,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:32,018 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 415 transitions and produced 314 states. [2022-03-03 20:44:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:32,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-03 20:44:32,219 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,SelfDestructingSolverStorable3 [2022-03-03 20:44:32,220 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-03-03 20:44:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2065679512, now seen corresponding path program 2 times [2022-03-03 20:44:32,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:32,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434505589] [2022-03-03 20:44:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-03 20:44:32,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:32,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434505589] [2022-03-03 20:44:32,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434505589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:44:32,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 20:44:32,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 20:44:32,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771558423] [2022-03-03 20:44:32,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:44:32,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 20:44:32,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:32,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 20:44:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 20:44:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:32,306 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:32,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:32,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:32,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:32,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:32,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:32,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:35,078 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 433 transitions and produced 326 states. [2022-03-03 20:44:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:35,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 20:44:35,079 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-03-03 20:44:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -219255834, now seen corresponding path program 1 times [2022-03-03 20:44:35,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:35,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591600610] [2022-03-03 20:44:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:35,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:35,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591600610] [2022-03-03 20:44:35,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591600610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:44:35,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688500093] [2022-03-03 20:44:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:35,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:35,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:35,252 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-03-03 20:44:35,284 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-03-03 20:44:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:35,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 20:44:35,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:44:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:35,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:44:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:36,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688500093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:44:36,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:44:36,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 20:44:36,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380656537] [2022-03-03 20:44:36,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:44:36,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 20:44:36,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:36,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 20:44:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 20:44:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:36,310 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:36,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:36,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:39,947 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 677 transitions and produced 452 states. [2022-03-03 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:44:39,964 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-03-03 20:44:40,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:40,149 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-03-03 20:44:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2009867110, now seen corresponding path program 2 times [2022-03-03 20:44:40,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:40,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791956841] [2022-03-03 20:44:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 20:44:40,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:40,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791956841] [2022-03-03 20:44:40,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791956841] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:44:40,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852725430] [2022-03-03 20:44:40,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 20:44:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:40,455 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-03-03 20:44:40,457 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-03-03 20:44:40,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 20:44:40,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:44:40,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-03 20:44:40,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:44:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2022-03-03 20:44:41,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 20:44:41,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852725430] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:44:41,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 20:44:41,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2022-03-03 20:44:41,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982624331] [2022-03-03 20:44:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:44:41,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-03 20:44:41,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-03 20:44:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-03-03 20:44:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:41,109 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:41,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:41,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:41,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:41,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:44:41,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:49,030 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1726 transitions and produced 1440 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:44:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:44:49,054 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-03-03 20:44:49,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:49,248 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-03-03 20:44:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:44:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -353511241, now seen corresponding path program 1 times [2022-03-03 20:44:49,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:44:49,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418544269] [2022-03-03 20:44:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:44:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:44:49,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:44:49,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418544269] [2022-03-03 20:44:49,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418544269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:44:49,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51895112] [2022-03-03 20:44:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:44:49,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:44:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:44:49,641 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-03-03 20:44:49,707 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-03-03 20:44:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:44:49,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 20:44:49,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:44:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:44:51,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:44:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:44:52,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51895112] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:44:52,740 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:44:52,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-03 20:44:52,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640130099] [2022-03-03 20:44:52,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:44:52,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-03 20:44:52,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:44:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-03 20:44:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-03 20:44:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:52,744 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:44:52,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.0) internal successors, (612), 34 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:44:52,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:44:52,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:52,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:52,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:44:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:44:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:44:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:44:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:01,608 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2246 transitions and produced 1712 states. [2022-03-03 20:45:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:45:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:45:01,627 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-03-03 20:45:01,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:01,810 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-03-03 20:45:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:45:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 193955767, now seen corresponding path program 2 times [2022-03-03 20:45:01,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:45:01,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911807087] [2022-03-03 20:45:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:45:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:45:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:45:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:45:02,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:45:02,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911807087] [2022-03-03 20:45:02,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911807087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:45:02,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975902566] [2022-03-03 20:45:02,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 20:45:02,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:02,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:45:02,574 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-03-03 20:45:02,576 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-03-03 20:45:03,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 20:45:03,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:45:03,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2041 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-03 20:45:03,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:45:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:45:04,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:45:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-03 20:45:06,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975902566] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:45:06,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:45:06,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2022-03-03 20:45:06,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810807611] [2022-03-03 20:45:06,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:45:06,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-03 20:45:06,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:45:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-03 20:45:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 20:45:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:06,154 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:45:06,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 17.837209302325583) internal successors, (767), 43 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:45:06,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:16,600 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2571 transitions and produced 1882 states. [2022-03-03 20:45:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:45:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:45:16,621 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-03-03 20:45:16,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:16,802 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-03-03 20:45:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:45:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2083782119, now seen corresponding path program 3 times [2022-03-03 20:45:16,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:45:16,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723954543] [2022-03-03 20:45:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:45:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:45:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:45:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 4282 proven. 401 refuted. 0 times theorem prover too weak. 5910 trivial. 0 not checked. [2022-03-03 20:45:17,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:45:17,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723954543] [2022-03-03 20:45:17,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723954543] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:45:17,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509812576] [2022-03-03 20:45:17,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 20:45:17,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:17,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:45:17,864 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-03-03 20:45:17,867 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-03-03 20:45:18,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 20:45:18,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:45:18,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 20:45:18,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:45:21,123 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-03-03 20:45:21,164 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 6 treesize of output 5 [2022-03-03 20:45:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 937 proven. 77 refuted. 0 times theorem prover too weak. 9579 trivial. 0 not checked. [2022-03-03 20:45:22,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:45:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 627 proven. 6 refuted. 0 times theorem prover too weak. 9960 trivial. 0 not checked. [2022-03-03 20:45:24,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509812576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:45:24,328 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:45:24,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 18, 15] total 74 [2022-03-03 20:45:24,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150715407] [2022-03-03 20:45:24,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:45:24,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-03 20:45:24,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:45:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-03 20:45:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=4775, Unknown=0, NotChecked=0, Total=5402 [2022-03-03 20:45:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:24,334 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:45:24,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 11.567567567567568) internal successors, (856), 74 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:45:24,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:45:24,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:45:24,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:49,126 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6302 transitions and produced 3413 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:45:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:45:49,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-03 20:45:49,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:49,328 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-03-03 20:45:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:45:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -518529853, now seen corresponding path program 1 times [2022-03-03 20:45:49,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:45:49,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491536047] [2022-03-03 20:45:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:45:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:45:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:45:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 1938 proven. 37 refuted. 0 times theorem prover too weak. 3935 trivial. 0 not checked. [2022-03-03 20:45:50,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:45:50,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491536047] [2022-03-03 20:45:50,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491536047] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:45:50,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123927286] [2022-03-03 20:45:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:45:50,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:45:50,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:45:50,616 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-03-03 20:45:50,620 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-03-03 20:45:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:45:51,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-03 20:45:51,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:45:52,422 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-03-03 20:45:52,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:45:52,491 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-03-03 20:45:52,636 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-03 20:45:52,637 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-03 20:45:52,664 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 20:45:52,664 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-03-03 20:45:52,677 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-03-03 20:45:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 3275 proven. 204 refuted. 0 times theorem prover too weak. 2431 trivial. 0 not checked. [2022-03-03 20:45:53,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:46:01,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1676) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-03 20:46:01,777 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:46:01,777 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-03-03 20:46:01,785 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:46:01,786 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-03-03 20:46:01,789 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-03-03 20:46:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 3227 proven. 204 refuted. 0 times theorem prover too weak. 2431 trivial. 48 not checked. [2022-03-03 20:46:02,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123927286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:46:02,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:46:02,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 37 [2022-03-03 20:46:02,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332327122] [2022-03-03 20:46:02,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:46:02,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-03 20:46:02,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:46:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-03 20:46:02,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1104, Unknown=1, NotChecked=68, Total=1332 [2022-03-03 20:46:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:02,501 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:46:02,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 14.45945945945946) internal successors, (535), 37 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:46:02,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:46:02,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:46:02,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:46:02,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:22,992 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6382 transitions and produced 3453 states. [2022-03-03 20:46:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:46:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:46:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:46:23,011 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-03-03 20:46:23,193 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,SelfDestructingSolverStorable10 [2022-03-03 20:46:23,194 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-03-03 20:46:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:46:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 795465041, now seen corresponding path program 1 times [2022-03-03 20:46:23,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:46:23,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617872340] [2022-03-03 20:46:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:46:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:46:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:46:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2359 proven. 71 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2022-03-03 20:46:24,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:46:24,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617872340] [2022-03-03 20:46:24,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617872340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:46:24,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530449893] [2022-03-03 20:46:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:46:24,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:46:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:46:24,343 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-03-03 20:46:24,345 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-03-03 20:46:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:46:24,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-03 20:46:24,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:46:25,449 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-03-03 20:46:25,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:46:25,507 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-03-03 20:46:25,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:46:25,710 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:46:25,710 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-03-03 20:46:25,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:46:25,758 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-03-03 20:46:25,892 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-03-03 20:46:25,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:46:25,961 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-03-03 20:46:26,100 INFO L353 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-03-03 20:46:26,101 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-03-03 20:46:26,129 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 20:46:26,129 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-03-03 20:46:26,148 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-03-03 20:46:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2335 proven. 95 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2022-03-03 20:46:26,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:46:27,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (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_2066) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-03 20:46:27,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (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_2066) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-03 20:46:27,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-03 20:46:27,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (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_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-03 20:46:27,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (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 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))))) is different from false [2022-03-03 20:46:27,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 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|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-03 20:46:27,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int)) (or (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 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_199| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-03 20:46:27,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 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_199| (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_199| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2062))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse3)) 20))))) is different from false [2022-03-03 20:46:27,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse3 .cse1)))))) is different from false [2022-03-03 20:46:28,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) is different from false [2022-03-03 20:46:28,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:46:28,080 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-03-03 20:46:28,089 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:46:28,089 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-03-03 20:46:28,094 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-03-03 20:46:28,113 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-03-03 20:46:28,198 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-03-03 20:46:28,213 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:46:28,213 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-03-03 20:46:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2239 proven. 66 refuted. 0 times theorem prover too weak. 3460 trivial. 125 not checked. [2022-03-03 20:46:28,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530449893] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:46:28,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:46:28,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 22] total 55 [2022-03-03 20:46:28,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514748462] [2022-03-03 20:46:28,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:46:28,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-03 20:46:28,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:46:28,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-03 20:46:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1737, Unknown=10, NotChecked=950, Total=2970 [2022-03-03 20:46:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:28,708 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:46:28,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 11.872727272727273) internal successors, (653), 55 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:46:28,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:28,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:28,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:28,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:46:28,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:46:28,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:29,541 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|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) (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|) (= (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-03-03 20:46:29,880 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_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse5 .cse2))))))) (= |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-03-03 20:46:30,269 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_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse2)))))) (= |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-03-03 20:46:30,715 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 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_199| (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_199| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2062))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse3)) 20))))) (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) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 20:46:32,744 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_199| Int)) (or (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 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_199| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.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|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 20:46:35,214 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|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) (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) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 20:46:54,048 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6406 transitions and produced 3465 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:46:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:46:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:46:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:46:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:46:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 20:46:54,071 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-03-03 20:46:54,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:46:54,254 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-03-03 20:46:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:46:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1693503490, now seen corresponding path program 2 times [2022-03-03 20:46:54,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:46:54,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807406371] [2022-03-03 20:46:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:46:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:46:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:46:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 3365 proven. 275 refuted. 0 times theorem prover too weak. 2400 trivial. 0 not checked. [2022-03-03 20:46:55,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:46:55,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807406371] [2022-03-03 20:46:55,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807406371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:46:55,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291078364] [2022-03-03 20:46:55,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 20:46:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:46:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:46:55,496 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-03-03 20:46:55,532 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-03-03 20:46:55,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 20:46:55,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:46:55,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 20:46:55,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:46:56,047 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 20:46:56,047 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-03-03 20:46:56,089 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-03 20:46:56,090 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-03-03 20:46:56,216 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-03-03 20:46:56,256 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 20:46:56,256 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-03-03 20:46:56,511 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-03-03 20:46:56,568 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-03-03 20:46:56,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:46:56,766 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:46:56,766 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-03-03 20:46:56,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:46:56,814 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-03-03 20:46:56,836 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-03-03 20:46:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5659 trivial. 0 not checked. [2022-03-03 20:46:57,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 20:46:57,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291078364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 20:46:57,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 20:46:57,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [24] total 39 [2022-03-03 20:46:57,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766599440] [2022-03-03 20:46:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 20:46:57,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-03 20:46:57,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:46:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-03 20:46:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 20:46:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:57,573 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:46:57,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.352941176470589) internal successors, (193), 17 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:46:57,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:46:57,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:57,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-03-03 20:46:57,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:47:18,143 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6406 transitions and produced 3465 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 20:47:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 20:47:18,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-03 20:47:18,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-03 20:47:18,345 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-03-03 20:47:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:47:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1756260456, now seen corresponding path program 3 times [2022-03-03 20:47:18,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:47:18,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530563476] [2022-03-03 20:47:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:47:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:47:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:47:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1783 proven. 331 refuted. 0 times theorem prover too weak. 3926 trivial. 0 not checked. [2022-03-03 20:47:19,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:47:19,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530563476] [2022-03-03 20:47:19,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530563476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:47:19,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757425763] [2022-03-03 20:47:19,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 20:47:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:47:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:47:19,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 20:47:19,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-03 20:47:20,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-03 20:47:20,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:47:20,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 93 conjunts are in the unsatisfiable core [2022-03-03 20:47:20,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:47:23,974 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-03-03 20:47:24,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:24,055 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-03-03 20:47:24,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:47:24,341 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:47:24,341 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-03-03 20:47:24,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:24,425 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-03-03 20:47:24,670 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 34 treesize of output 18 [2022-03-03 20:47:24,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:24,781 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-03-03 20:47:25,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:47:25,039 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:47:25,039 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-03-03 20:47:25,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:25,114 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-03-03 20:47:25,315 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 34 treesize of output 18 [2022-03-03 20:47:25,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:25,424 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-03-03 20:47:25,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:47:25,719 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-03-03 20:47:25,720 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 31 treesize of output 27 [2022-03-03 20:47:25,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:47:25,780 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-03-03 20:47:25,826 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-03-03 20:47:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1633 proven. 481 refuted. 0 times theorem prover too weak. 3926 trivial. 0 not checked. [2022-03-03 20:47:25,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:47:26,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-03 20:47:26,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (or (not (<= v_ArrVal_2850 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (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|) v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-03 20:47:26,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2850) (< (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|) v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-03 20:47:26,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850)))) is different from false [2022-03-03 20:47:26,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850)))) is different from false [2022-03-03 20:47:26,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse0 (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_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-03-03 20:47:26,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) is different from false [2022-03-03 20:47:26,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850))))) is different from false [2022-03-03 20:47:26,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20))))) is different from false [2022-03-03 20:47:26,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2022-03-03 20:47:27,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (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|) v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_2843 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2)))))))) is different from false [2022-03-03 20:47:27,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (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|) v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2843) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2)))))))) is different from false [2022-03-03 20:47:27,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2843) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse4))))))))) is different from false [2022-03-03 20:47:27,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2843) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse1))))))))) is different from false [2022-03-03 20:47:28,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (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_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20))))))) is different from false [2022-03-03 20:47:28,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2843) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse4))))))))))) is different from false [2022-03-03 20:47:28,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2843) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2850)))))))) is different from false [2022-03-03 20:47:29,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) is different from false [2022-03-03 20:47:30,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) is different from false [2022-03-03 20:47:31,237 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:47:31,238 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 331 treesize of output 241 [2022-03-03 20:47:31,251 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:47:31,251 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 404 treesize of output 404 [2022-03-03 20:47:31,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:47:31,262 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 232 treesize of output 216 [2022-03-03 20:47:31,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:47:31,275 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 145 treesize of output 137 [2022-03-03 20:47:31,284 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 110 treesize of output 94 [2022-03-03 20:47:32,169 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-03-03 20:47:32,711 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:47:32,712 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 414 treesize of output 410 [2022-03-03 20:47:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 234 proven. 565 refuted. 0 times theorem prover too weak. 3926 trivial. 1315 not checked. [2022-03-03 20:47:34,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757425763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 20:47:34,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 20:47:34,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 36] total 80 [2022-03-03 20:47:34,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641470793] [2022-03-03 20:47:34,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 20:47:34,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-03 20:47:34,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 20:47:34,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-03 20:47:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=3071, Unknown=19, NotChecked=2584, Total=6320 [2022-03-03 20:47:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:47:34,387 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-03 20:47:34,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 9.2875) internal successors, (743), 80 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 20:47:34,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:47:34,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-03 20:47:34,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:47:35,595 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (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| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) (= |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) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse8 1) (<= .cse8 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:36,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) (= |c_~#queue~0.offset| 0) (= (select .cse8 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse8 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:36,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) (= (select .cse7 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:37,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (select .cse7 (+ 84 |c_~#queue~0.offset|)))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) (= (select .cse7 84) 1) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse8 1) (<= .cse8 3) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-03-03 20:47:37,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2843) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2850)))))))) (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) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse7 1) (<= .cse7 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:39,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |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|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2843) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse5) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse6 .cse5))))))))))) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:40,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |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) (<= .cse0 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 1) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20)))))) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:41,266 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-03 20:47:41,695 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2022-03-03 20:47:42,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_~#queue~0.offset| 0) (<= .cse0 2) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20))))))) is different from false [2022-03-03 20:47:42,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850))))) (= |c_~#queue~0.offset| 0) (<= .cse3 2) (= |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|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse3 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:47:44,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (<= .cse0 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-03 20:48:04,650 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6422 transitions and produced 3473 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-03 20:48:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-03 20:48:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-03 20:48:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 20:48:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 20:48:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 20:48:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-03 20:48:04,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-03 20:48:04,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-03 20:48:04,852 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-03-03 20:48:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 20:48:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash -937047652, now seen corresponding path program 4 times [2022-03-03 20:48:04,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 20:48:04,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794807104] [2022-03-03 20:48:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 20:48:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 20:48:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 20:48:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 3433 proven. 248 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2022-03-03 20:48:06,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 20:48:06,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794807104] [2022-03-03 20:48:06,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794807104] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 20:48:06,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106124598] [2022-03-03 20:48:06,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 20:48:06,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 20:48:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 20:48:06,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 20:48:06,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-03 20:48:15,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 20:48:15,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 20:48:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 107 conjunts are in the unsatisfiable core [2022-03-03 20:48:15,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 20:48:16,348 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-03-03 20:48:16,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:16,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, 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-03-03 20:48:16,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:16,578 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:48:16,578 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-03-03 20:48:16,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:16,621 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-03-03 20:48:16,757 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-03-03 20:48:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:16,826 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-03-03 20:48:17,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:17,013 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:48:17,014 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-03-03 20:48:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:17,059 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-03-03 20:48:17,198 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-03-03 20:48:17,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:17,268 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-03-03 20:48:17,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:17,482 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:48:17,483 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-03-03 20:48:17,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:17,527 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-03-03 20:48:17,727 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-03-03 20:48:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:17,802 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-03-03 20:48:17,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:17,979 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-03 20:48:17,979 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-03-03 20:48:18,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 20:48:18,028 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-03-03 20:48:18,044 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-03-03 20:48:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2818 proven. 235 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2022-03-03 20:48:18,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 20:48:31,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-03 20:48:31,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 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_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))) is different from false [2022-03-03 20:48:31,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 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_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-03 20:48:31,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 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_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-03 20:48:31,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 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_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-03 20:48:31,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 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_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-03 20:48:31,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (or (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 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_318| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-03 20:48:31,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_318| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse3) 20)))))) is different from false [2022-03-03 20:48:31,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))))))) is different from false [2022-03-03 20:48:31,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1)))))))) is different from false [2022-03-03 20:48:31,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1)))))))) is different from false [2022-03-03 20:48:31,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) is different from false [2022-03-03 20:48:31,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) is different from false [2022-03-03 20:48:32,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1)))))))) is different from false [2022-03-03 20:48:32,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1)))))))) is different from false [2022-03-03 20:48:32,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int)) (or (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_321| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-03 20:48:32,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (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 .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3245))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse3))) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse4 .cse3))))))))) is different from false [2022-03-03 20:48:32,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 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_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))))))))) is different from false [2022-03-03 20:48:33,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1)))))))))) is different from false [2022-03-03 20:48:33,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (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_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))))))) is different from false [2022-03-03 20:48:33,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (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_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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 .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))) is different from false [2022-03-03 20:48:33,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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 .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))) is different from false [2022-03-03 20:48:34,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1)))))))))) is different from false [2022-03-03 20:48:34,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (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_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))))))) is different from false [2022-03-03 20:48:34,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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 .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (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_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))))) is different from false [2022-03-03 20:48:35,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3238))) (store .cse11 .cse5 (+ (select .cse11 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse8 v_ArrVal_3245))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse8 v_ArrVal_3253))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse4 .cse5))))))))))) is different from false [2022-03-03 20:48:36,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_3236) .cse7 v_ArrVal_3238))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse7 v_ArrVal_3245))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse7 v_ArrVal_3253))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))))))))))) is different from false [2022-03-03 20:48:38,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3235))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse10 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_3236) .cse7 v_ArrVal_3238))) (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse7 v_ArrVal_3245))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse7 v_ArrVal_3253))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse4 .cse1)))))))))))) is different from false [2022-03-03 20:48:39,754 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:48:39,754 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 2324 treesize of output 1664 [2022-03-03 20:48:39,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:48:39,792 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 2319 treesize of output 2293 [2022-03-03 20:48:39,817 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 2053 treesize of output 1989 [2022-03-03 20:48:39,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:39,842 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 2473 treesize of output 2425 [2022-03-03 20:48:39,896 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 9167 treesize of output 9131 [2022-03-03 20:48:39,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 20:48:39,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9371 treesize of output 9339 [2022-03-03 20:48:40,211 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-03-03 20:48:41,502 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 20:48:41,503 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 12334 treesize of output 12250 [2022-03-03 20:48:41,535 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-03 20:48:41,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-03 20:48:41,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-03 20:48:41,740 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-03 20:48:41,743 INFO L158 Benchmark]: Toolchain (without parser) took 256799.84ms. Allocated memory was 190.8MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 132.6MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-03-03 20:48:41,743 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 20:48:41,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.22ms. Allocated memory was 190.8MB in the beginning and 271.6MB in the end (delta: 80.7MB). Free memory was 132.4MB in the beginning and 223.7MB in the end (delta: -91.3MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. [2022-03-03 20:48:41,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.23ms. Allocated memory is still 271.6MB. Free memory was 223.7MB in the beginning and 221.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 20:48:41,743 INFO L158 Benchmark]: Boogie Preprocessor took 25.63ms. Allocated memory is still 271.6MB. Free memory was 221.0MB in the beginning and 218.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 20:48:41,743 INFO L158 Benchmark]: RCFGBuilder took 510.63ms. Allocated memory is still 271.6MB. Free memory was 218.9MB in the beginning and 199.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-03 20:48:41,744 INFO L158 Benchmark]: TraceAbstraction took 255636.36ms. Allocated memory was 271.6MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 199.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-03-03 20:48:41,745 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.45ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.22ms. Allocated memory was 190.8MB in the beginning and 271.6MB in the end (delta: 80.7MB). Free memory was 132.4MB in the beginning and 223.7MB in the end (delta: -91.3MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.23ms. Allocated memory is still 271.6MB. Free memory was 223.7MB in the beginning and 221.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.63ms. Allocated memory is still 271.6MB. Free memory was 221.0MB in the beginning and 218.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 510.63ms. Allocated memory is still 271.6MB. Free memory was 218.9MB in the beginning and 199.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 255636.36ms. Allocated memory was 271.6MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 199.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-03 20:48:41,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-03-03 20:48:41,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...