/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:54:42,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:54:42,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:54:42,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:54:42,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:54:42,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:54:42,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:54:42,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:54:42,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:54:42,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:54:42,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:54:42,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:54:42,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:54:42,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:54:42,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:54:42,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:54:42,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:54:42,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:54:42,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:54:42,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:54:42,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:54:42,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:54:42,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:54:42,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:54:42,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:54:42,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:54:42,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:54:42,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:54:42,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:54:42,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:54:42,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:54:42,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:54:42,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:54:42,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:54:42,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:54:42,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:54:42,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:54:42,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:54:42,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:54:42,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:54:42,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:54:42,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf [2022-03-15 22:54:42,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:54:42,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:54:42,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 22:54:42,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 22:54:42,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:54:42,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:54:42,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:54:42,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:54:42,169 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:54:42,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:54:42,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:54:42,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:54:42,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:54:42,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-15 22:54:42,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:54:42,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:54:42,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:54:42,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:54:42,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 22:54:42,353 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 22:54:42,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-03-15 22:54:42,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db2e3147/c1f689fe7eaf42289d4c964272dacd0f/FLAGa067a16d9 [2022-03-15 22:54:42,832 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 22:54:42,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-03-15 22:54:42,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db2e3147/c1f689fe7eaf42289d4c964272dacd0f/FLAGa067a16d9 [2022-03-15 22:54:42,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db2e3147/c1f689fe7eaf42289d4c964272dacd0f [2022-03-15 22:54:42,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:54:42,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 22:54:42,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 22:54:42,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 22:54:42,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 22:54:42,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 10:54:42" (1/1) ... [2022-03-15 22:54:42,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586ae84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:42, skipping insertion in model container [2022-03-15 22:54:42,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 10:54:42" (1/1) ... [2022-03-15 22:54:42,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 22:54:42,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 22:54:43,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-03-15 22:54:43,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 22:54:43,276 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 22:54:43,309 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/stack_longest-2.i[41530,41543] [2022-03-15 22:54:43,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 22:54:43,368 INFO L208 MainTranslator]: Completed translation [2022-03-15 22:54:43,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43 WrapperNode [2022-03-15 22:54:43,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 22:54:43,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:54:43,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:54:43,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:54:43,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,428 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2022-03-15 22:54:43,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:54:43,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:54:43,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:54:43,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:54:43,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:54:43,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:54:43,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:54:43,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:54:43,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (1/1) ... [2022-03-15 22:54:43,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:54:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:43,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:54:43,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 22:54:43,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 22:54:43,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 22:54:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 22:54:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 22:54:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 22:54:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 22:54:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:54:43,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:54:43,562 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:54:43,675 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:54:43,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:54:43,884 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:54:43,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:54:43,891 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 22:54:43,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:54:43 BoogieIcfgContainer [2022-03-15 22:54:43,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:54:43,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:54:43,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:54:43,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:54:43,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 10:54:42" (1/3) ... [2022-03-15 22:54:43,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:54:43, skipping insertion in model container [2022-03-15 22:54:43,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 10:54:43" (2/3) ... [2022-03-15 22:54:43,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe089a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:54:43, skipping insertion in model container [2022-03-15 22:54:43,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:54:43" (3/3) ... [2022-03-15 22:54:43,905 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-03-15 22:54:43,909 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:54:43,909 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:54:43,909 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 22:54:43,909 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:54:43,955 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,955 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,955 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,955 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,956 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,957 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,957 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,957 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,957 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,957 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,958 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,959 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,960 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,965 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,966 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,967 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,967 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,976 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,976 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,977 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,977 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,977 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,977 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,977 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,978 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,979 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,979 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,979 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,979 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,980 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,980 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,980 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,980 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,981 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,992 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,992 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,992 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,992 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,993 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,993 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,994 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,995 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,996 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,997 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,998 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:43,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,001 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,005 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,005 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,005 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,005 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,006 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,007 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,008 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,013 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,013 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,014 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,015 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,021 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,021 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,021 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,022 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,023 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,023 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,023 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,024 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,024 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,024 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,024 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,024 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,027 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,028 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,029 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,030 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,031 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,033 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,033 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,033 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,033 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,033 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,034 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,035 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,035 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,035 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,035 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,035 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 22:54:44,039 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 22:54:44,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-15 22:54:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:44,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-15 22:54:44,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-15 22:54:44,146 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:54:44,154 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=false [2022-03-15 22:54:44,154 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 22:54:44,723 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-15 22:54:44,725 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1385514707, now seen corresponding path program 1 times [2022-03-15 22:54:44,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:44,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130988157] [2022-03-15 22:54:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:44,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:44,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130988157] [2022-03-15 22:54:44,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130988157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:44,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:44,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:54:44,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472200729] [2022-03-15 22:54:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:44,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 22:54:44,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 22:54:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 22:54:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,020 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:45,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:45,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,334 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-15 22:54:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:54:45,335 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -692413010, now seen corresponding path program 1 times [2022-03-15 22:54:45,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:45,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431431548] [2022-03-15 22:54:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:45,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:45,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431431548] [2022-03-15 22:54:45,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431431548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:45,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:45,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:45,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938457220] [2022-03-15 22:54:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:45,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:45,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,394 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:45,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:45,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,609 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 140 transitions and produced 113 states. [2022-03-15 22:54:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:45,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:54:45,610 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -783544309, now seen corresponding path program 1 times [2022-03-15 22:54:45,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:45,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946136995] [2022-03-15 22:54:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:45,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:45,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946136995] [2022-03-15 22:54:45,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946136995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:45,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:45,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:45,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060161025] [2022-03-15 22:54:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:45,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:45,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,701 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:45,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,046 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 153 states. [2022-03-15 22:54:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:54:46,047 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1126730609, now seen corresponding path program 1 times [2022-03-15 22:54:46,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:46,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238586416] [2022-03-15 22:54:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:46,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:46,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238586416] [2022-03-15 22:54:46,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238586416] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:46,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:46,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:54:46,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750586141] [2022-03-15 22:54:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:46,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:46,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:54:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,098 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:46,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:46,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,545 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 231 transitions and produced 179 states. [2022-03-15 22:54:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 22:54:46,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash -839370342, now seen corresponding path program 1 times [2022-03-15 22:54:46,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:46,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113538129] [2022-03-15 22:54:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:46,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:46,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113538129] [2022-03-15 22:54:46,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113538129] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:46,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:54:46,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 22:54:46,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890109417] [2022-03-15 22:54:46,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:46,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:54:46,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:54:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:54:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,633 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:46,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:46,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:46,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,513 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 203 transitions and produced 204 states. [2022-03-15 22:54:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:47,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 22:54:47,515 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1663540157, now seen corresponding path program 1 times [2022-03-15 22:54:47,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:47,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784009490] [2022-03-15 22:54:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:47,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:47,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784009490] [2022-03-15 22:54:47,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784009490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:47,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520178386] [2022-03-15 22:54:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:47,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:47,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:47,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:47,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:54:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:47,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-15 22:54:47,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:54:47,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:54:47,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520178386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:54:47,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:54:47,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-15 22:54:47,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576712258] [2022-03-15 22:54:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:54:47,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:54:47,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:54:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 22:54:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,822 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:47,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:47,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,021 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 231 transitions and produced 232 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:49,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 22:54:49,239 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -274763786, now seen corresponding path program 1 times [2022-03-15 22:54:49,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:49,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638509569] [2022-03-15 22:54:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:49,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:49,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638509569] [2022-03-15 22:54:49,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638509569] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:49,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944545298] [2022-03-15 22:54:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:49,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:54:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:49,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:54:49,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:49,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:49,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944545298] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:49,837 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:49,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:54:49,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395691734] [2022-03-15 22:54:49,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:49,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:54:49,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:54:49,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:54:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,839 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:49,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:49,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:49,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:49,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:49,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:51,043 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 388 transitions and produced 283 states. [2022-03-15 22:54:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:54:51,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:51,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:51,262 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1304490822, now seen corresponding path program 1 times [2022-03-15 22:54:51,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:51,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363493560] [2022-03-15 22:54:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:51,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:51,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363493560] [2022-03-15 22:54:51,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363493560] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:51,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846575501] [2022-03-15 22:54:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:51,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:51,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:54:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:51,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 22:54:51,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:51,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:51,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846575501] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:51,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:51,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:54:51,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216190149] [2022-03-15 22:54:51,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:51,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:54:51,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:54:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:54:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:51,815 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:51,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.5) internal successors, (265), 10 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:51,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:51,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:51,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:51,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:54:51,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:53,877 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 691 transitions and produced 533 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:54:53,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:54,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:54,095 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:54,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1724175136, now seen corresponding path program 2 times [2022-03-15 22:54:54,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:54,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755899701] [2022-03-15 22:54:54,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:54,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:54,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755899701] [2022-03-15 22:54:54,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755899701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:54,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409704022] [2022-03-15 22:54:54,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:54:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:54,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:54,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:54:54,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:54:54,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:54:54,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:54:54,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:54,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:55,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409704022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:55,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:55,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 22:54:55,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452370128] [2022-03-15 22:54:55,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:55,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:54:55,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:54:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:54:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:55,059 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:55,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.166666666666668) internal successors, (381), 18 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:54:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:57,164 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 754 transitions and produced 543 states. [2022-03-15 22:54:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:54:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:54:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:54:57,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:57,382 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:54:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:54:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -474495952, now seen corresponding path program 2 times [2022-03-15 22:54:57,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:54:57,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735628503] [2022-03-15 22:54:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:54:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:54:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:54:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:57,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:54:57,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735628503] [2022-03-15 22:54:57,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735628503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:54:57,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230938259] [2022-03-15 22:54:57,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:54:57,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:54:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:54:57,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:54:57,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:54:57,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:54:57,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:54:57,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:54:57,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:54:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:57,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:54:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:54:58,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230938259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:54:58,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:54:58,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 22:54:58,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643256001] [2022-03-15 22:54:58,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:54:58,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:54:58,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:54:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:54:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:54:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:58,389 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:54:58,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 24.055555555555557) internal successors, (433), 18 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:54:58,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:54:58,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:02,553 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1423 transitions and produced 1053 states. [2022-03-15 22:55:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:02,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:55:02,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:02,774 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash -597988428, now seen corresponding path program 3 times [2022-03-15 22:55:02,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:02,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915496677] [2022-03-15 22:55:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:03,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:03,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915496677] [2022-03-15 22:55:03,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915496677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:03,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689223201] [2022-03-15 22:55:03,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:55:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:03,033 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:03,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:55:03,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:55:03,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:55:03,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 22:55:03,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:04,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 22:55:04,825 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 63 treesize of output 23 [2022-03-15 22:55:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-03-15 22:55:05,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 22:55:05,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689223201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:55:05,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 22:55:05,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [17] total 38 [2022-03-15 22:55:05,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895744242] [2022-03-15 22:55:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 22:55:05,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:55:05,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:55:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:55:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:05,137 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:05,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:14,292 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1496 transitions and produced 1126 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:14,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 22:55:14,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:14,512 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -351793445, now seen corresponding path program 1 times [2022-03-15 22:55:14,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:14,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772707122] [2022-03-15 22:55:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:14,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:14,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772707122] [2022-03-15 22:55:14,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772707122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:14,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113651530] [2022-03-15 22:55:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:14,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:14,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:55:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:55:14,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:15,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:16,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113651530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:16,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:16,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-15 22:55:16,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318087344] [2022-03-15 22:55:16,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:16,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:55:16,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:55:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:55:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:16,127 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:16,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 21.264705882352942) internal successors, (723), 34 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:16,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:16,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:16,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:16,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:16,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:20,087 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1486 transitions and produced 1063 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:55:20,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 22:55:20,305 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,SelfDestructingSolverStorable11 [2022-03-15 22:55:20,306 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1413993724, now seen corresponding path program 3 times [2022-03-15 22:55:20,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:20,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680992584] [2022-03-15 22:55:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:20,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:20,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:20,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680992584] [2022-03-15 22:55:20,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680992584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:20,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161428543] [2022-03-15 22:55:20,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:55:20,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:20,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:20,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:55:20,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 22:55:20,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:55:20,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:55:20,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:21,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:21,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161428543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:21,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:21,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-15 22:55:21,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324190806] [2022-03-15 22:55:21,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:21,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:55:21,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:55:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 22:55:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:21,689 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:21,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 22.61764705882353) internal successors, (769), 34 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:21,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:21,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:21,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:21,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:55:21,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:30,278 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2960 transitions and produced 2166 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:55:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:55:30,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:55:30,489 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,SelfDestructingSolverStorable12 [2022-03-15 22:55:30,490 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash -130425805, now seen corresponding path program 2 times [2022-03-15 22:55:30,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:30,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460410330] [2022-03-15 22:55:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:31,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:31,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460410330] [2022-03-15 22:55:31,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460410330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:31,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332076427] [2022-03-15 22:55:31,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:55:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:31,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:31,014 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:55:31,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:55:31,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:55:31,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:55:31,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:32,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:55:33,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332076427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:33,813 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:33,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-03-15 22:55:33,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520963131] [2022-03-15 22:55:33,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:33,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 22:55:33,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 22:55:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:55:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:33,817 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:33,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 21.136363636363637) internal successors, (1395), 66 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:33,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:33,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:55:33,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:55:33,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:41,917 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2950 transitions and produced 2103 states. [2022-03-15 22:55:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:55:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:55:41,937 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-03-15 22:55:42,131 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,SelfDestructingSolverStorable13 [2022-03-15 22:55:42,132 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:55:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:55:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -826667860, now seen corresponding path program 4 times [2022-03-15 22:55:42,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:55:42,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283219163] [2022-03-15 22:55:42,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:55:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:55:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:55:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:42,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:55:42,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283219163] [2022-03-15 22:55:42,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283219163] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:55:42,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997510854] [2022-03-15 22:55:42,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:55:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:55:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:55:42,610 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:55:42,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:55:44,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:55:44,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:55:44,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:55:44,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:55:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:44,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:55:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:55:45,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997510854] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:55:45,949 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:55:45,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-03-15 22:55:45,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333427436] [2022-03-15 22:55:45,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:55:45,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 22:55:45,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:55:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 22:55:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:55:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:45,956 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:55:45,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 21.833333333333332) internal successors, (1441), 66 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:55:45,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:55:45,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:04,269 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5888 transitions and produced 4246 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:56:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 22:56:04,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 22:56:04,483 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,SelfDestructingSolverStorable14 [2022-03-15 22:56:04,484 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 22:56:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:56:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1588012771, now seen corresponding path program 3 times [2022-03-15 22:56:04,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:56:04,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002214739] [2022-03-15 22:56:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:56:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:56:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:56:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 0 proven. 19561 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-15 22:56:06,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:56:06,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002214739] [2022-03-15 22:56:06,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002214739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:56:06,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365565699] [2022-03-15 22:56:06,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:56:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:56:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:56:06,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:56:06,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:56:06,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:56:06,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:56:06,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 22:56:06,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:56:08,764 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 19 treesize of output 15 [2022-03-15 22:56:09,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:56:09,611 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 71 treesize of output 43 [2022-03-15 22:56:10,679 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 63 treesize of output 23 [2022-03-15 22:56:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 2270 proven. 66 refuted. 0 times theorem prover too weak. 17255 trivial. 0 not checked. [2022-03-15 22:56:10,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:56:13,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-15 22:56:15,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) is different from false [2022-03-15 22:56:45,633 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 54 treesize of output 46 [2022-03-15 22:56:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 2270 proven. 60 refuted. 0 times theorem prover too weak. 17255 trivial. 6 not checked. [2022-03-15 22:56:47,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365565699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:56:47,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:56:47,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 30, 29] total 120 [2022-03-15 22:56:47,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600199497] [2022-03-15 22:56:47,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 22:56:47,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-03-15 22:56:47,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:56:47,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-03-15 22:56:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=12546, Unknown=7, NotChecked=466, Total=14280 [2022-03-15 22:56:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:47,330 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 22:56:47,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 15.125) internal successors, (1815), 120 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:56:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-15 22:56:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 22:56:52,920 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse1 (not .cse2)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse2)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) .cse2 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-03-15 22:56:53,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-03-15 22:56:55,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-03-15 22:56:59,607 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:00,377 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:02,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2))) is different from false [2022-03-15 22:57:05,589 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3)))) is different from false [2022-03-15 22:57:06,301 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) is different from false [2022-03-15 22:57:08,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) is different from false [2022-03-15 22:57:11,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:12,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:14,243 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:17,609 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:18,335 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:20,357 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:23,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:24,332 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:26,354 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:29,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)))) is different from false [2022-03-15 22:57:30,511 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7))) is different from false [2022-03-15 22:57:32,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7))) is different from false [2022-03-15 22:57:35,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:36,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:38,684 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:41,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:42,715 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:44,737 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:48,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:48,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:50,993 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:57:54,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:57:55,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:57:57,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:00,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:01,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:03,821 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12))) is different from false [2022-03-15 22:58:07,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)))) is different from false [2022-03-15 22:58:08,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13))) is different from false [2022-03-15 22:58:10,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13))) is different from false [2022-03-15 22:58:14,003 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:14,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:16,879 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:20,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:21,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:23,163 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:26,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16)))) is different from false [2022-03-15 22:58:27,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16))) is different from false [2022-03-15 22:58:29,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16))) is different from false [2022-03-15 22:58:33,141 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:33,887 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:35,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:39,648 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:40,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:42,489 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18))) is different from false [2022-03-15 22:58:46,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:47,130 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:49,153 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:52,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:58:53,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:58:55,764 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:58:59,524 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:00,363 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:02,392 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:59:06,169 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:07,013 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:09,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22))) is different from false [2022-03-15 22:59:12,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:13,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:15,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:59:19,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:20,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:22,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:59:26,447 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:27,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:29,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25))) is different from false [2022-03-15 22:59:33,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:34,066 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:36,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:59:40,191 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:41,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:43,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 22:59:47,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)))) is different from false [2022-03-15 22:59:48,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28))) is different from false [2022-03-15 22:59:50,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28))) is different from false [2022-03-15 22:59:54,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 22:59:55,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 22:59:57,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 23:00:01,090 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 23:00:01,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 23:00:03,942 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 23:00:08,115 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-15 23:00:09,006 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-15 23:00:09,079 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5878 transitions and produced 4183 states. [2022-03-15 23:00:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:00:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:00:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 23:00:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 509 states. [2022-03-15 23:00:09,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 23:00:09,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 23:00:09,287 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 23:00:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 23:00:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1536024580, now seen corresponding path program 5 times [2022-03-15 23:00:09,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 23:00:09,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837567979] [2022-03-15 23:00:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 23:00:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 23:00:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 23:00:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:00:10,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 23:00:10,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837567979] [2022-03-15 23:00:10,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837567979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 23:00:10,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460706265] [2022-03-15 23:00:10,842 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 23:00:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:00:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 23:00:10,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 23:00:10,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 23:00:55,589 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-03-15 23:00:55,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 23:00:55,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 23:00:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 23:00:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:00:57,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 23:01:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 23:01:01,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460706265] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 23:01:01,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 23:01:01,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2022-03-15 23:01:01,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779454234] [2022-03-15 23:01:01,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 23:01:01,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-03-15 23:01:01,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:01:01,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-03-15 23:01:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 23:01:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:01,183 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:01:01,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 21.423076923076923) internal successors, (2785), 130 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:01:01,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 509 states. [2022-03-15 23:01:01,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:21,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-15 23:01:31,777 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6144 transitions and produced 4449 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 23:01:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 544 states. [2022-03-15 23:01:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 23:01:31,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 23:01:31,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 23:01:31,994 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 23:01:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 23:01:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2140323423, now seen corresponding path program 4 times [2022-03-15 23:01:31,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 23:01:31,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639305553] [2022-03-15 23:01:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 23:01:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 23:01:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 23:01:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20959 backedges. 0 proven. 20864 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-03-15 23:01:33,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 23:01:33,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639305553] [2022-03-15 23:01:33,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639305553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 23:01:33,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131670589] [2022-03-15 23:01:33,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 23:01:33,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 23:01:33,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 23:01:33,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 23:01:33,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process Received shutdown request... [2022-03-15 23:09:05,905 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:09:05,905 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:09:05,906 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 23:09:06,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-03-15 23:09:06,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-03-15 23:09:07,106 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forcibly destroying the process [2022-03-15 23:09:07,147 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-15 23:09:07,147 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-15 23:09:07,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2022-03-15 23:09:07,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687308220] [2022-03-15 23:09:07,148 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-15 23:09:07,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 23:09:07,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 23:09:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 23:09:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 23:09:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:09:07,150 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-15 23:09:07,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 21.417910447761194) internal successors, (1435), 67 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 23:09:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:09:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:09:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:09:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:09:07,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-15 23:09:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 137 [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-15 23:09:07,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-15 23:09:07,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-15 23:09:07,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 544 states. [2022-03-15 23:09:07,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-03-15 23:09:07,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-15 23:09:07,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 23:09:07,160 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-15 23:09:07,161 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-03-15 23:09:07,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 23:09:07,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-03-15 23:09:07,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 23:09:07,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 23:09:07,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 23:09:07,179 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-15 23:09:07,181 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 23:09:07,182 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 23:09:07,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 11:09:07 BasicIcfg [2022-03-15 23:09:07,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 23:09:07,185 INFO L158 Benchmark]: Toolchain (without parser) took 864319.84ms. Allocated memory was 187.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 161.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.69ms. Allocated memory is still 187.7MB. Free memory was 161.6MB in the beginning and 143.3MB in the end (delta: 18.3MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.36ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: Boogie Preprocessor took 31.52ms. Allocated memory is still 187.7MB. Free memory was 140.6MB in the beginning and 138.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: RCFGBuilder took 430.95ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 123.0MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 23:09:07,186 INFO L158 Benchmark]: TraceAbstraction took 863290.17ms. Allocated memory was 187.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 122.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-15 23:09:07,188 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.13ms. Allocated memory is still 187.7MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.69ms. Allocated memory is still 187.7MB. Free memory was 161.6MB in the beginning and 143.3MB in the end (delta: 18.3MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.36ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.52ms. Allocated memory is still 187.7MB. Free memory was 140.6MB in the beginning and 138.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 430.95ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 123.0MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 863290.17ms. Allocated memory was 187.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 122.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 272 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 863.1s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 293.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1043, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 47.1s SatisfiabilityAnalysisTime, 64.0s InterpolantComputationTime, 14180 NumberOfCodeBlocks, 12710 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 19803 ConstructedInterpolants, 20 QuantifiedInterpolants, 65254 SizeOfPredicates, 233 NumberOfNonLiveVariables, 9238 ConjunctsInSsa, 314 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 40929/176630 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown