/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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.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-44898dd [2022-02-09 10:28:19,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 10:28:19,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 10:28:19,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 10:28:19,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 10:28:19,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 10:28:19,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 10:28:19,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 10:28:19,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 10:28:19,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 10:28:19,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 10:28:19,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 10:28:19,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 10:28:19,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 10:28:19,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 10:28:19,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 10:28:19,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 10:28:19,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 10:28:19,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 10:28:19,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 10:28:19,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 10:28:19,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 10:28:19,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 10:28:19,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 10:28:19,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 10:28:19,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 10:28:19,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 10:28:19,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 10:28:19,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 10:28:19,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 10:28:19,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 10:28:19,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 10:28:19,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 10:28:19,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 10:28:19,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 10:28:19,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 10:28:19,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 10:28:19,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 10:28:19,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 10:28:19,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 10:28:19,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 10:28:19,491 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2022-02-09 10:28:19,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 10:28:19,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 10:28:19,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 10:28:19,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 10:28:19,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 10:28:19,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 10:28:19,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 10:28:19,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 10:28:19,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 10:28:19,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 10:28:19,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 10:28:19,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 10:28:19,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 10:28:19,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 10:28:19,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 10:28:19,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 10:28:19,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 10:28:19,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 10:28:19,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 10:28:19,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 10:28:19,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 10:28:19,518 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 10:28:19,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-09 10:28:19,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 10:28:19,518 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-09 10:28:19,518 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-09 10:28:19,519 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-02-09 10:28:19,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 10:28:19,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 10:28:19,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 10:28:19,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 10:28:19,749 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 10:28:19,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-02-09 10:28:19,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5413a3f/45071f3f745a4f6f95a1a1a604f8a8c3/FLAG2477f7b09 [2022-02-09 10:28:20,233 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 10:28:20,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-02-09 10:28:20,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5413a3f/45071f3f745a4f6f95a1a1a604f8a8c3/FLAG2477f7b09 [2022-02-09 10:28:20,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5413a3f/45071f3f745a4f6f95a1a1a604f8a8c3 [2022-02-09 10:28:20,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 10:28:20,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 10:28:20,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 10:28:20,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 10:28:20,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 10:28:20,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a703669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20, skipping insertion in model container [2022-02-09 10:28:20,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 10:28:20,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 10:28:20,671 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-02-09 10:28:20,674 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-02-09 10:28:20,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 10:28:20,685 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 10:28:20,723 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-02-09 10:28:20,725 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-02-09 10:28:20,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 10:28:20,774 INFO L208 MainTranslator]: Completed translation [2022-02-09 10:28:20,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20 WrapperNode [2022-02-09 10:28:20,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 10:28:20,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 10:28:20,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 10:28:20,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 10:28:20,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,846 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-02-09 10:28:20,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 10:28:20,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 10:28:20,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 10:28:20,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 10:28:20,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 10:28:20,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 10:28:20,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 10:28:20,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 10:28:20,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (1/1) ... [2022-02-09 10:28:20,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 10:28:20,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:20,955 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-02-09 10:28:20,960 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-02-09 10:28:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-09 10:28:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-09 10:28:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 10:28:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 10:28:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 10:28:21,014 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 10:28:21,128 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 10:28:21,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 10:28:21,319 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 10:28:21,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 10:28:21,326 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-09 10:28:21,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:28:21 BoogieIcfgContainer [2022-02-09 10:28:21,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 10:28:21,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 10:28:21,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 10:28:21,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 10:28:21,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 10:28:20" (1/3) ... [2022-02-09 10:28:21,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205a6b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:28:21, skipping insertion in model container [2022-02-09 10:28:21,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:28:20" (2/3) ... [2022-02-09 10:28:21,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205a6b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:28:21, skipping insertion in model container [2022-02-09 10:28:21,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:28:21" (3/3) ... [2022-02-09 10:28:21,333 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-02-09 10:28:21,336 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 10:28:21,336 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 10:28:21,337 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-09 10:28:21,337 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 10:28:21,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,396 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,398 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,399 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,400 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,401 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,402 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,409 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,410 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,411 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,412 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,413 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,414 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,415 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,416 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,417 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,418 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,419 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,435 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,435 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,435 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,436 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,437 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:28:21,443 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-09 10:28:21,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 10:28:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:21,490 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-02-09 10:28:21,528 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-02-09 10:28:21,542 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-09 10:28:21,547 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 [2022-02-09 10:28:21,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-09 10:28:21,591 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-09 10:28:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2068546759, now seen corresponding path program 1 times [2022-02-09 10:28:21,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:21,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021897768] [2022-02-09 10:28:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:21,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:21,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:21,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021897768] [2022-02-09 10:28:21,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021897768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:28:21,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:28:21,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 10:28:21,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010578084] [2022-02-09 10:28:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:28:21,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 10:28:21,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 10:28:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 10:28:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:21,782 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:21,783 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-02-09 10:28:21,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,115 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-09 10:28:22,115 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-09 10:28:22,116 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-09 10:28:22,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 10:28:22,130 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-09 10:28:22,131 INFO L309 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2022-02-09 10:28:22,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 10:28:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:22,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-09 10:28:22,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-02-09 10:28:22,147 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-02-09 10:28:22,147 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 [2022-02-09 10:28:22,147 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-09 10:28:22,241 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -881764122, now seen corresponding path program 1 times [2022-02-09 10:28:22,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:22,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235177343] [2022-02-09 10:28:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:22,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:22,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:22,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235177343] [2022-02-09 10:28:22,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235177343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:28:22,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:28:22,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 10:28:22,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747222859] [2022-02-09 10:28:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:28:22,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 10:28:22,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 10:28:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 10:28:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,345 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:22,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:22,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 10:28:22,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1635222354, now seen corresponding path program 1 times [2022-02-09 10:28:22,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:22,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727152262] [2022-02-09 10:28:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:22,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:22,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:22,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727152262] [2022-02-09 10:28:22,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727152262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:28:22,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:28:22,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 10:28:22,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152767393] [2022-02-09 10:28:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:28:22,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 10:28:22,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 10:28:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 10:28:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,454 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:22,454 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-02-09 10:28:22,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:22,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 10:28:22,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1113328484, now seen corresponding path program 1 times [2022-02-09 10:28:22,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:22,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744892452] [2022-02-09 10:28:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:22,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:22,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:22,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744892452] [2022-02-09 10:28:22,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744892452] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:22,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529891055] [2022-02-09 10:28:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:22,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:22,758 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-02-09 10:28:22,775 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-02-09 10:28:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:22,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-09 10:28:22,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:23,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:23,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529891055] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:23,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:23,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-09 10:28:23,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145709471] [2022-02-09 10:28:23,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:23,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 10:28:23,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 10:28:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-09 10:28:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:23,474 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:23,474 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-02-09 10:28:23,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:23,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:23,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:23,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-09 10:28:23,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:23,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2104961628, now seen corresponding path program 2 times [2022-02-09 10:28:23,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:23,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635128530] [2022-02-09 10:28:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:23,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:23,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:23,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635128530] [2022-02-09 10:28:23,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635128530] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:23,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469275963] [2022-02-09 10:28:23,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 10:28:23,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:23,967 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-02-09 10:28:24,032 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-02-09 10:28:24,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 10:28:24,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:28:24,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-09 10:28:24,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-09 10:28:24,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 10:28:24,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469275963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:28:24,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 10:28:24,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-02-09 10:28:24,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542738084] [2022-02-09 10:28:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:28:24,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 10:28:24,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 10:28:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-09 10:28:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:24,372 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:24,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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-02-09 10:28:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:24,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-09 10:28:24,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:24,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -913134929, now seen corresponding path program 1 times [2022-02-09 10:28:24,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:24,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52966410] [2022-02-09 10:28:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:24,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:24,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:24,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52966410] [2022-02-09 10:28:24,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52966410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:24,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188704740] [2022-02-09 10:28:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:24,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:24,744 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-02-09 10:28:24,745 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-02-09 10:28:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:24,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 10:28:24,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:25,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:25,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188704740] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:25,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:25,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 10:28:25,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315491819] [2022-02-09 10:28:25,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:25,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 10:28:25,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 10:28:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-09 10:28:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:25,440 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:25,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.61111111111111) internal successors, (353), 18 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:25,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:25,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:25,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:25,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:25,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:25,612 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-02-09 10:28:25,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:25,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 673021743, now seen corresponding path program 2 times [2022-02-09 10:28:25,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:25,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186325906] [2022-02-09 10:28:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:25,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:26,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:26,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186325906] [2022-02-09 10:28:26,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186325906] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:26,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943971829] [2022-02-09 10:28:26,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 10:28:26,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:26,019 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-02-09 10:28:26,051 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-02-09 10:28:26,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 10:28:26,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:28:26,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-09 10:28:26,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:26,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:27,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943971829] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:27,350 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:27,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-02-09 10:28:27,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617589564] [2022-02-09 10:28:27,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:27,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-09 10:28:27,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-09 10:28:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-02-09 10:28:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:27,352 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:27,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 17.676470588235293) internal successors, (601), 34 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:27,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:27,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-09 10:28:28,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:28,055 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash 668330031, now seen corresponding path program 3 times [2022-02-09 10:28:28,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:28,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060137559] [2022-02-09 10:28:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:28,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:28,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:28,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060137559] [2022-02-09 10:28:28,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060137559] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:28,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802267622] [2022-02-09 10:28:28,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 10:28:28,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:28,541 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-02-09 10:28:28,583 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-02-09 10:28:28,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-09 10:28:28,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:28:28,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-09 10:28:28,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:30,696 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-02-09 10:28:30,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:28:30,753 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-02-09 10:28:30,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:28:30,952 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:28:30,953 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-02-09 10:28:30,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:28:30,993 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-02-09 10:28:31,017 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-02-09 10:28:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-02-09 10:28:31,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:39,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_815 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_815) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-02-09 10:28:39,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:28:39,479 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-02-09 10:28:39,496 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:28:39,497 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-02-09 10:28:39,500 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-02-09 10:28:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-02-09 10:28:40,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802267622] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:40,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:40,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-02-09 10:28:40,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673017065] [2022-02-09 10:28:40,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:40,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-02-09 10:28:40,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-02-09 10:28:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2291, Unknown=1, NotChecked=100, Total=2756 [2022-02-09 10:28:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:40,338 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:40,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 16.62264150943396) internal successors, (881), 53 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:40,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-02-09 10:28:43,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-09 10:28:43,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:43,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1895810629, now seen corresponding path program 1 times [2022-02-09 10:28:43,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:43,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128747173] [2022-02-09 10:28:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:43,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:44,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:44,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128747173] [2022-02-09 10:28:44,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128747173] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:44,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887025815] [2022-02-09 10:28:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:44,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:44,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:44,392 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-02-09 10:28:44,392 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-02-09 10:28:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-09 10:28:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:45,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 10:28:46,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887025815] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:46,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:46,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-02-09 10:28:46,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799148553] [2022-02-09 10:28:46,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:46,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-09 10:28:46,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-09 10:28:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-02-09 10:28:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:46,633 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:46,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.976744186046513) internal successors, (859), 43 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-02-09 10:28:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-09 10:28:47,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-09 10:28:47,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-09 10:28:47,794 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,SelfDestructingSolverStorable8 [2022-02-09 10:28:47,794 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1972149809, now seen corresponding path program 2 times [2022-02-09 10:28:47,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:47,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459822497] [2022-02-09 10:28:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:47,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:28:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3613 proven. 155 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2022-02-09 10:28:48,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:28:48,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459822497] [2022-02-09 10:28:48,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459822497] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:28:48,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807194383] [2022-02-09 10:28:48,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 10:28:48,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:28:48,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:28:48,768 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-02-09 10:28:48,769 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-02-09 10:28:49,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 10:28:49,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:28:49,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-09 10:28:49,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:28:50,557 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-02-09 10:28:50,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:28:50,605 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-02-09 10:28:50,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:28:50,778 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:28:50,778 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-02-09 10:28:50,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:28:50,821 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-02-09 10:28:50,946 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-02-09 10:28:51,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:28:51,008 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-02-09 10:28:51,187 INFO L353 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-02-09 10:28:51,187 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 33 treesize of output 32 [2022-02-09 10:28:51,219 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-09 10:28:51,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-09 10:28:51,266 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-02-09 10:28:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3439 proven. 306 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2022-02-09 10:28:51,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:28:52,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1517 (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_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1)) 20))) is different from false [2022-02-09 10:28:52,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1517 (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_1517) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse1)) 20))) is different from false [2022-02-09 10:28:52,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1517 (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_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1)) 20))) is different from false [2022-02-09 10:28:52,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1517 (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_1517) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse1)) 20))) is different from false [2022-02-09 10:28:52,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1513)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse1)) 20))) is different from false [2022-02-09 10:28:52,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1511) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1513)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse1))))) is different from false [2022-02-09 10:28:52,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int)) (or (forall ((v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1511) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1513)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-02-09 10:28:52,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (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 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1513))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse3)) 20))))) is different from false [2022-02-09 10:28:52,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1513))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1519)) .cse1)))))) is different from false [2022-02-09 10:28:52,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1510))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1513))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select .cse4 .cse1))))))) is different from false [2022-02-09 10:28:52,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:28:52,552 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-02-09 10:28:52,560 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:28:52,560 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-02-09 10:28:52,564 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-02-09 10:28:52,573 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-02-09 10:28:52,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-02-09 10:28:52,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:28:52,647 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 329 treesize of output 321 [2022-02-09 10:28:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3039 proven. 250 refuted. 0 times theorem prover too weak. 2172 trivial. 429 not checked. [2022-02-09 10:28:53,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807194383] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:28:53,636 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:28:53,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 22] total 55 [2022-02-09 10:28:53,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452660662] [2022-02-09 10:28:53,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:28:53,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-02-09 10:28:53,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:28:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-02-09 10:28:53,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1715, Unknown=10, NotChecked=950, Total=2970 [2022-02-09 10:28:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:53,639 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:28:53,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 11.709090909090909) internal successors, (644), 55 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:28:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-02-09 10:28:53,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:54,229 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1510))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1513))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select .cse4 .cse1))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-02-09 10:28:54,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1510 (Array Int Int)) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1510))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1513))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1519)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select .cse5 .cse2))))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-02-09 10:28:54,963 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1513))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1519)) .cse1)))))) (= (select .cse4 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse4 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-02-09 10:28:55,323 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| Int) (v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (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 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4)) v_ArrVal_1511) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1513))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1519)) .cse3)) 20))))) (= |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-02-09 10:28:57,327 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_163| Int)) (or (forall ((v_ArrVal_1519 Int) (v_ArrVal_1511 Int) (v_ArrVal_1513 Int) (v_ArrVal_1517 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1511) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1513)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1517) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1519)) .cse1))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_163| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= |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_~#stored_elements~0.base| 6)) is different from false [2022-02-09 10:28:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-09 10:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-09 10:28:59,112 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-02-09 10:28:59,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-09 10:28:59,290 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:28:59,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:28:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1619329602, now seen corresponding path program 3 times [2022-02-09 10:28:59,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:28:59,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323764469] [2022-02-09 10:28:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:28:59,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:28:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:29:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 2288 proven. 317 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2022-02-09 10:29:00,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:29:00,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323764469] [2022-02-09 10:29:00,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323764469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:29:00,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262567592] [2022-02-09 10:29:00,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 10:29:00,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:29:00,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:29:00,424 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-02-09 10:29:00,425 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-02-09 10:29:01,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-09 10:29:01,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:29:01,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 100 conjunts are in the unsatisfiable core [2022-02-09 10:29:01,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:29:03,094 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-02-09 10:29:03,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,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, 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-02-09 10:29:03,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:03,249 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:29:03,249 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-02-09 10:29:03,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,280 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-02-09 10:29:03,377 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-02-09 10:29:03,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,416 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-02-09 10:29:03,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:03,530 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-02-09 10:29:03,530 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-02-09 10:29:03,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,557 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-02-09 10:29:03,676 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-02-09 10:29:03,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,720 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-02-09 10:29:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:03,855 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-02-09 10:29:03,855 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-02-09 10:29:03,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:03,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-09 10:29:03,902 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-02-09 10:29:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 2147 proven. 458 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2022-02-09 10:29:03,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:29:04,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1))))) is different from false [2022-02-09 10:29:04,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (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_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1)) 20))) is different from false [2022-02-09 10:29:04,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (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_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1)) 20))) is different from false [2022-02-09 10:29:04,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (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 (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_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1))))) is different from false [2022-02-09 10:29:04,256 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (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 (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_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-02-09 10:29:04,262 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20) (forall ((v_ArrVal_1916 Int) (v_ArrVal_1914 (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 (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_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1)))))) is different from false [2022-02-09 10:29:04,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1910)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= 20 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse2)))))))) is different from false [2022-02-09 10:29:04,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int 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_1909) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1910)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1)) 20)) (= .cse4 20))))) is different from false [2022-02-09 10:29:04,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1909)) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1)) 20)) (= .cse4 20)))))) is different from false [2022-02-09 10:29:04,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (store (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1909)) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_1916)) .cse1)))) (= .cse4 20)))))) is different from false [2022-02-09 10:29:04,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse3 (select .cse2 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1) 20)) (= .cse3 20)))))) is different from false [2022-02-09 10:29:04,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2022-02-09 10:29:04,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.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_1907))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse2) 20))))))) is different from false [2022-02-09 10:29:04,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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_1907))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2022-02-09 10:29:04,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1) 20)) (= .cse4 20)))))) is different from false [2022-02-09 10:29:04,634 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1) 20)) (= .cse4 20)))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-02-09 10:29:04,648 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1916)) .cse1) 20)) (= .cse4 20)))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 20)) is different from false [2022-02-09 10:29:04,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1903)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse3) 20))))))))) is different from false [2022-02-09 10:29:04,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse7 (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_1901) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1903)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20)) (= .cse4 20) (= .cse5 20)))))))) is different from false [2022-02-09 10:29:04,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1901) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1903)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1916)) .cse3) 20))))))))))) is different from false [2022-02-09 10:29:05,049 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1901) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1903)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (select .cse9 .cse1))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse9 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse5 (store (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse6 (select .cse5 .cse3))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_1916)) .cse3) 20)) (= 20 .cse7) (= 20 .cse6))))))))) is different from false [2022-02-09 10:29:05,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1903)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1909)) .cse8 v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse5 .cse1))) (= .cse6 20) (= .cse4 20))))))))) is different from false [2022-02-09 10:29:05,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1900))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1903)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse10 .cse1))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) .cse8 v_ArrVal_1910))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (= 20 .cse2) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20))))))))))) is different from false [2022-02-09 10:29:05,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:05,984 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 1230 treesize of output 860 [2022-02-09 10:29:05,997 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:05,998 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 1079 treesize of output 1057 [2022-02-09 10:29:06,006 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 842 treesize of output 794 [2022-02-09 10:29:06,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:06,020 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 1129 treesize of output 1073 [2022-02-09 10:29:06,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:06,041 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 1002 treesize of output 938 [2022-02-09 10:29:06,259 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-02-09 10:29:06,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:06,291 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 7632 treesize of output 7308 [2022-02-09 10:29:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1027 proven. 365 refuted. 0 times theorem prover too weak. 3435 trivial. 1213 not checked. [2022-02-09 10:29:07,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262567592] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:29:07,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:29:07,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 35] total 80 [2022-02-09 10:29:07,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995646836] [2022-02-09 10:29:07,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:29:07,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-02-09 10:29:07,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:29:07,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-02-09 10:29:07,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2740, Unknown=23, NotChecked=3036, Total=6320 [2022-02-09 10:29:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:29:07,365 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:29:07,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 9.3) internal successors, (744), 80 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-02-09 10:29:07,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-02-09 10:29:07,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:29:08,086 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1900))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1903)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse10 .cse1))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) .cse8 v_ArrVal_1910))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (= 20 .cse2) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20))))))))))) (= |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) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-02-09 10:29:08,532 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1900))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1903)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse10 .cse1))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse6 (store (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) .cse8 v_ArrVal_1910))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (= 20 .cse2) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20))))))))))) (= |c_~#queue~0.offset| 0) (= (select .cse11 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse11 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-02-09 10:29:08,937 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (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_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1901) .cse8 v_ArrVal_1903)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse3 (store (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1909)) .cse8 v_ArrVal_1910))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1916)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse5 .cse1))) (= .cse6 20) (= .cse4 20))))))))) (= (select .cse10 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse10 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-02-09 10:29:09,340 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |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) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1901) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1903)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (select .cse9 .cse1))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse9 .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse5 (store (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse6 (select .cse5 .cse3))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_1916)) .cse3) 20)) (= 20 .cse7) (= 20 .cse6))))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-02-09 10:29:11,344 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |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_209| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_1903 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 Int) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1901 Int) (v_ArrVal_1914 (Array Int Int))) (let ((.cse7 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1901) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1903)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1907))) (let ((.cse5 (store (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) v_ArrVal_1909)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1910))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1914) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1916)) .cse3) 20))))))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-02-09 10:29:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-09 10:29:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-09 10:29:13,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-09 10:29:13,477 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,SelfDestructingSolverStorable10 [2022-02-09 10:29:13,477 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:29:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:29:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -791409546, now seen corresponding path program 4 times [2022-02-09 10:29:13,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:29:13,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105766362] [2022-02-09 10:29:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:29:13,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:29:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:29:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 3631 proven. 206 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2022-02-09 10:29:15,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:29:15,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105766362] [2022-02-09 10:29:15,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105766362] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:29:15,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032659051] [2022-02-09 10:29:15,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 10:29:15,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:29:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:29:15,139 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-02-09 10:29:15,140 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-02-09 10:29:24,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 10:29:24,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:29:24,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 103 conjunts are in the unsatisfiable core [2022-02-09 10:29:24,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:29:25,571 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-02-09 10:29:25,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:25,603 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-02-09 10:29:25,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:25,715 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:29:25,715 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-02-09 10:29:25,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:25,745 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-02-09 10:29:25,830 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-02-09 10:29:25,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:25,870 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-02-09 10:29:26,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:26,053 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:29:26,054 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-02-09 10:29:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:26,107 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-02-09 10:29:26,200 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-02-09 10:29:26,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:26,240 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-02-09 10:29:26,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:26,361 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:29:26,361 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-02-09 10:29:26,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:26,389 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-02-09 10:29:26,475 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-02-09 10:29:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:26,518 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-02-09 10:29:26,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:26,624 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-09 10:29:26,624 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-02-09 10:29:26,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 10:29:26,654 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-02-09 10:29:26,664 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-02-09 10:29:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 3733 proven. 304 refuted. 0 times theorem prover too weak. 2143 trivial. 0 not checked. [2022-02-09 10:29:26,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:29:39,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1)))))) is different from false [2022-02-09 10:29:39,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-02-09 10:29:39,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-02-09 10:29:39,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20))))) is different from false [2022-02-09 10:29:39,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2314)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-02-09 10:29:39,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2312) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2314)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))) is different from false [2022-02-09 10:29:39,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2312) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2314)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20))))))) is different from false [2022-02-09 10:29:39,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2312) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse3) 20)))))) is different from false [2022-02-09 10:29:39,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))))))) is different from false [2022-02-09 10:29:39,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20))))))) is different from false [2022-02-09 10:29:40,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) is different from false [2022-02-09 10:29:40,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))))) is different from false [2022-02-09 10:29:40,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))))) is different from false [2022-02-09 10:29:40,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 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_2307)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1)))))))) is different from false [2022-02-09 10:29:40,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 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_2305) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2307)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) is different from false [2022-02-09 10:29:40,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2305) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2307)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-02-09 10:29:40,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2305) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2307))) (store .cse7 .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2314))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse4))))))))) is different from false [2022-02-09 10:29:40,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (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 .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse3 .cse1))))))))) is different from false [2022-02-09 10:29:41,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2304))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) is different from false [2022-02-09 10:29:41,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 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_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (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_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse3 .cse1))) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1)))))))))) is different from false [2022-02-09 10:29:41,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 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_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ 1 (select .cse8 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (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_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse1)))))))))) is different from false [2022-02-09 10:29:41,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (v_ArrVal_2307 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_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) is different from false [2022-02-09 10:29:42,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2301)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (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_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse3 .cse1)))))))))) is different from false [2022-02-09 10:29:42,547 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2298 Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_2298) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2301)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ 1 (select .cse8 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1)))))))))) is different from false [2022-02-09 10:29:42,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int)) (or (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2298 Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 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_303| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2298) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2301)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse6 v_ArrVal_2307))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse6 v_ArrVal_2314))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-02-09 10:29:43,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2298 Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2298) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2301))) (store .cse11 .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (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 .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse8 v_ArrVal_2307))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse8 v_ArrVal_2314))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse5 .cse1))))))))))) is different from false [2022-02-09 10:29:43,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2298 Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (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 .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_~#queue~0.offset|) v_ArrVal_2298) .cse7 v_ArrVal_2301))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse7 v_ArrVal_2307))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.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_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse7 v_ArrVal_2314))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse3 .cse1))) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse4 .cse1))))))))))) is different from false [2022-02-09 10:29:44,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| Int) (v_ArrVal_2298 Int) (v_ArrVal_2320 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| Int) (v_ArrVal_2301 Int) (v_ArrVal_2312 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int) (v_ArrVal_2314 Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2297))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (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 .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_~#queue~0.offset|) v_ArrVal_2298) .cse7 v_ArrVal_2301))) (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304))) (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_300| 4) |c_~#queue~0.offset|) v_ArrVal_2305) .cse7 v_ArrVal_2307))) (store .cse9 .cse1 (+ 1 (select .cse9 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_2311))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| 4) |c_~#queue~0.offset|) v_ArrVal_2312) .cse7 v_ArrVal_2314))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2318) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| 4) |c_~#queue~0.offset|) v_ArrVal_2320) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_300| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_297| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_294| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse4 .cse1)))))))))))) is different from false [2022-02-09 10:29:45,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:45,610 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-02-09 10:29:45,630 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:45,631 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-02-09 10:29:45,675 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 35479 treesize of output 35419 [2022-02-09 10:29:45,753 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 34530 treesize of output 34466 [2022-02-09 10:29:45,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:45,844 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 35451 treesize of output 35403 [2022-02-09 10:29:45,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-09 10:29:45,926 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 35923 treesize of output 35891 [2022-02-09 10:29:46,260 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-02-09 10:29:47,700 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:29:47,700 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 8431 treesize of output 8403 [2022-02-09 10:29:47,719 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-09 10:29:47,745 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-02-09 10:29:47,943 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,SelfDestructingSolverStorable11 [2022-02-09 10:29:47,945 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-02-09 10:29:47,950 INFO L158 Benchmark]: Toolchain (without parser) took 87691.75ms. Allocated memory was 168.8MB in the beginning and 585.1MB in the end (delta: 416.3MB). Free memory was 110.4MB in the beginning and 303.1MB in the end (delta: -192.7MB). Peak memory consumption was 395.6MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,950 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 129.2MB in the beginning and 129.1MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 10:29:47,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.69ms. Allocated memory is still 168.8MB. Free memory was 110.2MB in the beginning and 120.9MB in the end (delta: -10.7MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.16ms. Allocated memory is still 168.8MB. Free memory was 120.9MB in the beginning and 117.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,950 INFO L158 Benchmark]: Boogie Preprocessor took 48.59ms. Allocated memory is still 168.8MB. Free memory was 117.8MB in the beginning and 115.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,951 INFO L158 Benchmark]: RCFGBuilder took 430.71ms. Allocated memory is still 168.8MB. Free memory was 115.9MB in the beginning and 97.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,951 INFO L158 Benchmark]: TraceAbstraction took 86620.94ms. Allocated memory was 168.8MB in the beginning and 585.1MB in the end (delta: 416.3MB). Free memory was 97.0MB in the beginning and 303.1MB in the end (delta: -206.1MB). Peak memory consumption was 382.1MB. Max. memory is 8.0GB. [2022-02-09 10:29:47,952 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 129.2MB in the beginning and 129.1MB in the end (delta: 75.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.69ms. Allocated memory is still 168.8MB. Free memory was 110.2MB in the beginning and 120.9MB in the end (delta: -10.7MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.16ms. Allocated memory is still 168.8MB. Free memory was 120.9MB in the beginning and 117.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.59ms. Allocated memory is still 168.8MB. Free memory was 117.8MB in the beginning and 115.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 430.71ms. Allocated memory is still 168.8MB. Free memory was 115.9MB in the beginning and 97.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 86620.94ms. Allocated memory was 168.8MB in the beginning and 585.1MB in the end (delta: 416.3MB). Free memory was 97.0MB in the beginning and 303.1MB in the end (delta: -206.1MB). Peak memory consumption was 382.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5855, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 87, negative conditional: 48, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 48, negative conditional: 9, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 48, negative conditional: 9, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5205, positive: 5166, positive conditional: 0, positive unconditional: 5166, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5205, positive: 5163, positive conditional: 0, positive unconditional: 5163, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5816, positive: 602, positive conditional: 0, positive unconditional: 602, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5205, unknown conditional: 0, unknown unconditional: 5205] , Statistics on independence cache: Total cache size (in pairs): 5205, Positive cache size: 5166, Positive conditional cache size: 0, Positive unconditional cache size: 5166, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 39 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 368, Number of trivial persistent sets: 368, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5501, positive: 5462, positive conditional: 0, positive unconditional: 5462, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5855, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 87, negative conditional: 48, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 48, negative conditional: 9, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 306, positive unconditional: 5462, negative: 48, negative conditional: 9, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5816, positive: 5768, positive conditional: 0, positive unconditional: 5768, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5205, positive: 5166, positive conditional: 0, positive unconditional: 5166, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5205, positive: 5163, positive conditional: 0, positive unconditional: 5163, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5816, positive: 602, positive conditional: 0, positive unconditional: 602, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5205, unknown conditional: 0, unknown unconditional: 5205] , Statistics on independence cache: Total cache size (in pairs): 5205, Positive cache size: 5166, Positive conditional cache size: 0, Positive unconditional cache size: 5166, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 39 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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-02-09 10:29:47,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-02-09 10:29:48,188 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-02-09 10:29:48,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...