/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.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 17:34:06,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:34:06,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:34:06,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:34:06,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:34:06,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:34:06,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:34:06,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:34:06,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:34:06,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:34:06,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:34:06,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:34:06,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:34:06,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:34:06,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:34:06,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:34:06,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:34:06,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:34:06,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:34:06,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:34:06,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:34:06,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:34:06,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:34:06,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:34:06,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:34:06,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:34:06,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:34:06,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:34:06,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:34:06,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:34:06,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:34:06,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:34:06,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:34:06,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:34:06,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:34:06,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:34:06,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:34:06,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:34:06,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:34:06,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:34:06,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:34:06,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:34:06,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:34:06,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:34:06,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:34:06,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:34:06,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:34:06,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:34:06,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:34:06,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:34:06,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:34:06,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:34:06,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:34:06,683 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 17:34:06,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:34:06,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:34:06,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:34:06,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:34:06,926 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:34:06,927 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 17:34:06,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6538dfa5/6b2b3aec07ec47738c03da7e62366ebf/FLAGdaa7677e2 [2022-03-15 17:34:07,405 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:34:07,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-03-15 17:34:07,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6538dfa5/6b2b3aec07ec47738c03da7e62366ebf/FLAGdaa7677e2 [2022-03-15 17:34:07,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6538dfa5/6b2b3aec07ec47738c03da7e62366ebf [2022-03-15 17:34:07,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:34:07,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:34:07,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:34:07,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:34:07,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:34:07,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:07,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dce3fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07, skipping insertion in model container [2022-03-15 17:34:07,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:07,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:34:07,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:34:07,815 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 17:34:07,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:34:07,853 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:34:07,906 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 17:34:07,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:34:07,961 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:34:07,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07 WrapperNode [2022-03-15 17:34:07,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:34:07,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:34:07,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:34:07,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:34:07,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:07,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,014 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2022-03-15 17:34:08,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:34:08,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:34:08,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:34:08,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:34:08,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:34:08,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:34:08,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:34:08,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:34:08,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (1/1) ... [2022-03-15 17:34:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:34:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:08,087 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 17:34:08,096 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 17:34:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 17:34:08,119 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 17:34:08,119 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:34:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 17:34:08,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:34:08,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:34:08,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:34:08,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:34:08,121 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 17:34:08,219 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:34:08,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:34:08,440 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:34:08,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:34:08,448 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 17:34:08,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:34:08 BoogieIcfgContainer [2022-03-15 17:34:08,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:34:08,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:34:08,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:34:08,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:34:08,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:34:07" (1/3) ... [2022-03-15 17:34:08,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d637b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:34:08, skipping insertion in model container [2022-03-15 17:34:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:34:07" (2/3) ... [2022-03-15 17:34:08,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d637b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:34:08, skipping insertion in model container [2022-03-15 17:34:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:34:08" (3/3) ... [2022-03-15 17:34:08,457 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-03-15 17:34:08,461 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:34:08,461 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:34:08,461 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:34:08,461 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:34:08,521 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,522 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,522 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,522 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,522 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,523 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,524 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,524 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,524 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,524 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,525 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,525 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,525 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,525 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,525 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,526 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,526 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,526 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,526 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,527 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,528 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,528 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,528 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,528 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 17:34:08,529 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,529 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 17:34:08,529 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 17:34:08,529 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 17:34:08,530 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 17:34:08,530 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 17:34:08,530 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 17:34:08,530 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 17:34:08,530 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 17:34:08,530 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 17:34:08,531 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 17:34:08,531 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 17:34:08,531 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,531 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,531 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,532 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,532 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,532 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,532 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,533 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,533 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,533 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,533 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,534 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,535 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,536 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,537 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,537 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,537 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,537 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,537 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,538 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,539 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,540 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,541 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,542 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,543 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,544 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,545 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,546 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,547 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,548 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,549 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,549 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,549 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,550 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,551 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,551 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,551 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,551 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,552 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,552 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,552 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,552 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,552 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,553 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,553 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,553 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,553 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,553 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,554 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,554 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,555 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,558 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,562 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,563 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,563 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,563 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,565 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,565 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,566 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,566 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,566 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,566 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,566 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,567 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,567 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,567 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,567 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,567 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,568 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,568 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,568 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,568 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,568 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,569 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,569 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,569 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,569 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,569 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,571 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,571 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,571 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,572 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,572 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,572 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,572 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,575 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,576 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 17:34:08,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,576 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,579 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 17:34:08,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,583 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:34:08,587 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 17:34:08,623 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:34:08,636 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:34:08,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:34:08,652 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:34:08,663 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 172 transitions, 360 flow [2022-03-15 17:34:08,668 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 172 transitions, 360 flow [2022-03-15 17:34:08,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 172 transitions, 360 flow [2022-03-15 17:34:08,737 INFO L129 PetriNetUnfolder]: 10/170 cut-off events. [2022-03-15 17:34:08,737 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 17:34:08,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 10/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-03-15 17:34:08,751 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2022-03-15 17:34:12,670 INFO L131 LiptonReduction]: Checked pairs total: 11337 [2022-03-15 17:34:12,670 INFO L133 LiptonReduction]: Total number of compositions: 165 [2022-03-15 17:34:12,680 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 90 flow [2022-03-15 17:34:12,724 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 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 17:34:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 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 17:34:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 17:34:12,731 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:12,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 17:34:12,732 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash -774186158, now seen corresponding path program 1 times [2022-03-15 17:34:12,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:12,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049051369] [2022-03-15 17:34:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:12,922 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 17:34:12,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:12,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049051369] [2022-03-15 17:34:12,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049051369] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:12,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:12,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:34:12,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451740425] [2022-03-15 17:34:12,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:12,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:12,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 17:34:12,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:12,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:12,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:34:12,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:34:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:12,961 INFO L87 Difference]: Start difference. First operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 17:34:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:13,033 INFO L93 Difference]: Finished difference Result 434 states and 1115 transitions. [2022-03-15 17:34:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:34:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-03-15 17:34:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:13,046 INFO L225 Difference]: With dead ends: 434 [2022-03-15 17:34:13,046 INFO L226 Difference]: Without dead ends: 416 [2022-03-15 17:34:13,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:13,049 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:13,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-03-15 17:34:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 392. [2022-03-15 17:34:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 389 states have (on average 2.67866323907455) internal successors, (1042), 391 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:34:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1042 transitions. [2022-03-15 17:34:13,101 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1042 transitions. Word has length 6 [2022-03-15 17:34:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:13,101 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 1042 transitions. [2022-03-15 17:34:13,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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 17:34:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1042 transitions. [2022-03-15 17:34:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:34:13,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:13,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:13,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:34:13,103 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1395510492, now seen corresponding path program 1 times [2022-03-15 17:34:13,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:13,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444815925] [2022-03-15 17:34:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:13,190 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 17:34:13,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:13,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444815925] [2022-03-15 17:34:13,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444815925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:13,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:13,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:34:13,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698130835] [2022-03-15 17:34:13,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:13,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:13,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 17:34:13,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:13,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:13,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:34:13,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:34:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:13,195 INFO L87 Difference]: Start difference. First operand 392 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 17:34:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:13,268 INFO L93 Difference]: Finished difference Result 432 states and 1145 transitions. [2022-03-15 17:34:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:34:13,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 17:34:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:13,272 INFO L225 Difference]: With dead ends: 432 [2022-03-15 17:34:13,272 INFO L226 Difference]: Without dead ends: 432 [2022-03-15 17:34:13,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:13,274 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:13,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-03-15 17:34:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-03-15 17:34:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 429 states have (on average 2.668997668997669) internal successors, (1145), 431 states have internal predecessors, (1145), 0 states have call successors, (0), 0 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 17:34:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1145 transitions. [2022-03-15 17:34:13,309 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1145 transitions. Word has length 10 [2022-03-15 17:34:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:13,309 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1145 transitions. [2022-03-15 17:34:13,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 17:34:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1145 transitions. [2022-03-15 17:34:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:34:13,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:13,311 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:13,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:34:13,311 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1627868975, now seen corresponding path program 1 times [2022-03-15 17:34:13,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:13,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474794909] [2022-03-15 17:34:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:13,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:13,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474794909] [2022-03-15 17:34:13,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474794909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:13,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405496710] [2022-03-15 17:34:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:13,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:13,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:34:13,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 17:34:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:13,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 17:34:13,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:13,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:13,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405496710] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:13,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:13,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 17:34:13,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474513005] [2022-03-15 17:34:13,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:13,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:13,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 17:34:13,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:13,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:13,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:34:13,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:34:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:34:13,614 INFO L87 Difference]: Start difference. First operand 432 states and 1145 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 17:34:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:13,746 INFO L93 Difference]: Finished difference Result 710 states and 1835 transitions. [2022-03-15 17:34:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:34:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 17:34:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:13,750 INFO L225 Difference]: With dead ends: 710 [2022-03-15 17:34:13,751 INFO L226 Difference]: Without dead ends: 710 [2022-03-15 17:34:13,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:34:13,753 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:13,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 2 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-03-15 17:34:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 544. [2022-03-15 17:34:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 541 states have (on average 2.7060998151571165) internal successors, (1464), 543 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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 17:34:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1464 transitions. [2022-03-15 17:34:13,775 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1464 transitions. Word has length 13 [2022-03-15 17:34:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:13,775 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1464 transitions. [2022-03-15 17:34:13,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 17:34:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1464 transitions. [2022-03-15 17:34:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:34:13,777 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:13,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:13,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 17:34:13,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:13,996 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1145049209, now seen corresponding path program 1 times [2022-03-15 17:34:13,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:13,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608523436] [2022-03-15 17:34:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:14,049 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 17:34:14,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:14,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608523436] [2022-03-15 17:34:14,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608523436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:14,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:14,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:34:14,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793033032] [2022-03-15 17:34:14,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:14,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:14,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 17:34:14,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:14,228 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:14,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:34:14,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:14,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:34:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:14,229 INFO L87 Difference]: Start difference. First operand 544 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 17:34:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:14,274 INFO L93 Difference]: Finished difference Result 250 states and 563 transitions. [2022-03-15 17:34:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:34:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 17:34:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:14,276 INFO L225 Difference]: With dead ends: 250 [2022-03-15 17:34:14,276 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 17:34:14,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:14,278 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:14,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:34:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 17:34:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2022-03-15 17:34:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 2.25) internal successors, (531), 237 states have internal predecessors, (531), 0 states have call successors, (0), 0 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 17:34:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 531 transitions. [2022-03-15 17:34:14,288 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 531 transitions. Word has length 16 [2022-03-15 17:34:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:14,288 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 531 transitions. [2022-03-15 17:34:14,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 17:34:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 531 transitions. [2022-03-15 17:34:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:34:14,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:14,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:14,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:34:14,293 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -511957004, now seen corresponding path program 1 times [2022-03-15 17:34:14,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:14,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367814142] [2022-03-15 17:34:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:14,367 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 17:34:14,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:14,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367814142] [2022-03-15 17:34:14,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367814142] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:14,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:14,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:34:14,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1721643151] [2022-03-15 17:34:14,368 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:14,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:14,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2022-03-15 17:34:14,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:14,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:34:14,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:34:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:14,408 INFO L87 Difference]: Start difference. First operand 238 states and 531 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 17:34:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:14,472 INFO L93 Difference]: Finished difference Result 296 states and 663 transitions. [2022-03-15 17:34:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:34:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 17:34:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:14,474 INFO L225 Difference]: With dead ends: 296 [2022-03-15 17:34:14,475 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 17:34:14,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:34:14,476 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:14,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 17:34:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2022-03-15 17:34:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 2.231707317073171) internal successors, (549), 247 states have internal predecessors, (549), 0 states have call successors, (0), 0 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 17:34:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 549 transitions. [2022-03-15 17:34:14,483 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 549 transitions. Word has length 17 [2022-03-15 17:34:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:14,484 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 549 transitions. [2022-03-15 17:34:14,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 17:34:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 549 transitions. [2022-03-15 17:34:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:34:14,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:14,485 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 17:34:14,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:34:14,485 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 709262962, now seen corresponding path program 2 times [2022-03-15 17:34:14,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:14,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706026339] [2022-03-15 17:34:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:14,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:14,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706026339] [2022-03-15 17:34:14,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706026339] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:14,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682910159] [2022-03-15 17:34:14,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:34:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:14,579 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 17:34:14,611 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 17:34:14,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:34:14,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 17:34:14,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:14,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:14,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682910159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:14,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:14,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 17:34:14,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314017398] [2022-03-15 17:34:14,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:14,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:14,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 17:34:14,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:14,859 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:14,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:34:14,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:34:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:34:14,860 INFO L87 Difference]: Start difference. First operand 248 states and 549 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 17:34:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:15,044 INFO L93 Difference]: Finished difference Result 404 states and 884 transitions. [2022-03-15 17:34:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:34:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 17:34:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:15,046 INFO L225 Difference]: With dead ends: 404 [2022-03-15 17:34:15,046 INFO L226 Difference]: Without dead ends: 404 [2022-03-15 17:34:15,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-03-15 17:34:15,047 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 100 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:15,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 2 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-15 17:34:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 304. [2022-03-15 17:34:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 302 states have (on average 2.23841059602649) internal successors, (676), 303 states have internal predecessors, (676), 0 states have call successors, (0), 0 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 17:34:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 676 transitions. [2022-03-15 17:34:15,055 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 676 transitions. Word has length 20 [2022-03-15 17:34:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:15,055 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 676 transitions. [2022-03-15 17:34:15,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 17:34:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 676 transitions. [2022-03-15 17:34:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:34:15,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:15,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:15,078 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 17:34:15,278 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 17:34:15,279 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 17:34:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash 415194429, now seen corresponding path program 1 times [2022-03-15 17:34:15,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:15,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260281508] [2022-03-15 17:34:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:15,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:15,579 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 17:34:15,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:15,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260281508] [2022-03-15 17:34:15,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260281508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:15,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:15,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 17:34:15,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970908444] [2022-03-15 17:34:15,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:15,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:15,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2022-03-15 17:34:15,589 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:15,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:15,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:34:15,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:34:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:34:15,947 INFO L87 Difference]: Start difference. First operand 304 states and 676 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 17:34:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:16,433 INFO L93 Difference]: Finished difference Result 485 states and 1075 transitions. [2022-03-15 17:34:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:34:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 17:34:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:16,435 INFO L225 Difference]: With dead ends: 485 [2022-03-15 17:34:16,435 INFO L226 Difference]: Without dead ends: 420 [2022-03-15 17:34:16,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:34:16,436 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:16,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 8 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:34:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-03-15 17:34:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350. [2022-03-15 17:34:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 348 states have (on average 2.25) internal successors, (783), 349 states have internal predecessors, (783), 0 states have call successors, (0), 0 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 17:34:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 783 transitions. [2022-03-15 17:34:16,445 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 783 transitions. Word has length 21 [2022-03-15 17:34:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:16,445 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 783 transitions. [2022-03-15 17:34:16,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 17:34:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 783 transitions. [2022-03-15 17:34:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:34:16,446 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:16,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:16,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:34:16,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1253157149, now seen corresponding path program 2 times [2022-03-15 17:34:16,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:16,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257297399] [2022-03-15 17:34:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:16,744 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 17:34:16,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:16,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257297399] [2022-03-15 17:34:16,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257297399] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:16,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:16,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 17:34:16,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507881502] [2022-03-15 17:34:16,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:16,751 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:16,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 17:34:16,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:16,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:16,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:34:16,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:34:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:34:16,895 INFO L87 Difference]: Start difference. First operand 350 states and 783 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 17:34:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:17,390 INFO L93 Difference]: Finished difference Result 506 states and 1124 transitions. [2022-03-15 17:34:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:34:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 17:34:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:17,394 INFO L225 Difference]: With dead ends: 506 [2022-03-15 17:34:17,394 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 17:34:17,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:34:17,395 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:17,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 17:34:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 17:34:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 332. [2022-03-15 17:34:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 330 states have (on average 2.2303030303030305) internal successors, (736), 331 states have internal predecessors, (736), 0 states have call successors, (0), 0 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 17:34:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 736 transitions. [2022-03-15 17:34:17,402 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 736 transitions. Word has length 21 [2022-03-15 17:34:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:17,402 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 736 transitions. [2022-03-15 17:34:17,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 17:34:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 736 transitions. [2022-03-15 17:34:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 17:34:17,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:17,403 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:17,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:34:17,404 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -447250857, now seen corresponding path program 1 times [2022-03-15 17:34:17,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:17,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800660410] [2022-03-15 17:34:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:17,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:17,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800660410] [2022-03-15 17:34:17,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800660410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:17,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920186118] [2022-03-15 17:34:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:17,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:17,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:17,455 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 17:34:17,459 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 17:34:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:17,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 17:34:17,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:34:17,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:34:17,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920186118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:17,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:34:17,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-03-15 17:34:17,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178948516] [2022-03-15 17:34:17,618 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:17,622 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:17,631 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 64 transitions. [2022-03-15 17:34:17,631 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:17,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10325#(or (<= ~top~0 0) (= ~top~0 800))] [2022-03-15 17:34:17,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:34:17,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:34:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:34:17,807 INFO L87 Difference]: Start difference. First operand 332 states and 736 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 17:34:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:17,970 INFO L93 Difference]: Finished difference Result 556 states and 1214 transitions. [2022-03-15 17:34:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:34:17,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 17:34:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:17,975 INFO L225 Difference]: With dead ends: 556 [2022-03-15 17:34:17,975 INFO L226 Difference]: Without dead ends: 544 [2022-03-15 17:34:17,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-03-15 17:34:17,976 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:17,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-03-15 17:34:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 404. [2022-03-15 17:34:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 402 states have (on average 2.228855721393035) internal successors, (896), 403 states have internal predecessors, (896), 0 states have call successors, (0), 0 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 17:34:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 896 transitions. [2022-03-15 17:34:17,987 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 896 transitions. Word has length 24 [2022-03-15 17:34:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:17,987 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 896 transitions. [2022-03-15 17:34:17,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 17:34:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 896 transitions. [2022-03-15 17:34:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 17:34:17,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:17,988 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-03-15 17:34:18,008 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 17:34:18,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:18,195 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 17:34:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1675970993, now seen corresponding path program 3 times [2022-03-15 17:34:18,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:18,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925419977] [2022-03-15 17:34:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:18,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:18,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925419977] [2022-03-15 17:34:18,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925419977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:18,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893827585] [2022-03-15 17:34:18,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:34:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:18,279 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 17:34:18,308 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 17:34:18,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:34:18,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:18,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:34:18,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:18,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:18,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893827585] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:18,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:18,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-03-15 17:34:18,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264791116] [2022-03-15 17:34:18,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:18,571 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:18,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 17:34:18,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:18,577 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:18,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:34:18,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:34:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-03-15 17:34:18,578 INFO L87 Difference]: Start difference. First operand 404 states and 896 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 17:34:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:18,775 INFO L93 Difference]: Finished difference Result 630 states and 1370 transitions. [2022-03-15 17:34:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 17:34:18,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 17:34:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:18,779 INFO L225 Difference]: With dead ends: 630 [2022-03-15 17:34:18,779 INFO L226 Difference]: Without dead ends: 630 [2022-03-15 17:34:18,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:34:18,780 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 129 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:18,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 3 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:34:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-03-15 17:34:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 476. [2022-03-15 17:34:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 474 states have (on average 2.2552742616033754) internal successors, (1069), 475 states have internal predecessors, (1069), 0 states have call successors, (0), 0 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 17:34:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1069 transitions. [2022-03-15 17:34:18,792 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1069 transitions. Word has length 27 [2022-03-15 17:34:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:18,792 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 1069 transitions. [2022-03-15 17:34:18,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 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 17:34:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1069 transitions. [2022-03-15 17:34:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:34:18,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:18,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:18,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 17:34:19,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:19,007 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 17:34:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1873591140, now seen corresponding path program 3 times [2022-03-15 17:34:19,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:19,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437156815] [2022-03-15 17:34:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:34:19,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:19,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437156815] [2022-03-15 17:34:19,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437156815] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:19,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:19,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 17:34:19,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524984624] [2022-03-15 17:34:19,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:19,289 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:19,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 96 transitions. [2022-03-15 17:34:19,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:21,088 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [13483#(or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (= ~top~0 799) (< 2147483646 ~top~0)), 13477#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))))), 13482#(or (= (+ ~top~0 1) 800) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (< 2147483646 ~top~0)), 13479#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)) (not (<= ~top~0 2147483647)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= ~top~0 800))), 13478#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (not (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (not (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))))), 13480#(or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800)), 13481#(or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0)), 13484#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 799) (< 2147483646 ~top~0)), 13485#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0))] [2022-03-15 17:34:21,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 17:34:21,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 17:34:21,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:34:21,090 INFO L87 Difference]: Start difference. First operand 476 states and 1069 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 17:34:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:22,605 INFO L93 Difference]: Finished difference Result 1012 states and 2260 transitions. [2022-03-15 17:34:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 17:34:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 17:34:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:22,610 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 17:34:22,610 INFO L226 Difference]: Without dead ends: 975 [2022-03-15 17:34:22,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=538, Invalid=1718, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 17:34:22,611 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:22,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 17:34:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-03-15 17:34:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 629. [2022-03-15 17:34:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 627 states have (on average 2.325358851674641) internal successors, (1458), 628 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 17:34:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1458 transitions. [2022-03-15 17:34:22,628 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1458 transitions. Word has length 28 [2022-03-15 17:34:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:22,628 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 1458 transitions. [2022-03-15 17:34:22,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 17:34:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1458 transitions. [2022-03-15 17:34:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:34:22,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:22,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:22,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:34:22,630 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 17:34:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1156335038, now seen corresponding path program 4 times [2022-03-15 17:34:22,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:22,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184925371] [2022-03-15 17:34:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:23,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:23,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184925371] [2022-03-15 17:34:23,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184925371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:23,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873565682] [2022-03-15 17:34:23,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:34:23,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:23,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:23,534 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 17:34:23,535 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 17:34:23,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:34:23,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:23,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 17:34:23,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:23,678 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:34:23,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:34:24,212 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 22 treesize of output 18 [2022-03-15 17:34:24,319 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 76 treesize of output 70 [2022-03-15 17:34:24,996 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 92 treesize of output 56 [2022-03-15 17:35:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:13,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:13,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_412) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:35:14,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:14,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:35:14,019 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:14,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:35:14,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:35:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:35:14,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873565682] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:35:14,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:35:14,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 14] total 50 [2022-03-15 17:35:14,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998492423] [2022-03-15 17:35:14,319 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:35:14,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:35:14,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2022-03-15 17:35:14,330 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:35:14,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:35:14,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 17:35:14,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:35:14,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 17:35:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2315, Unknown=22, NotChecked=98, Total=2652 [2022-03-15 17:35:14,975 INFO L87 Difference]: Start difference. First operand 629 states and 1458 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 17:35:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:22,228 INFO L93 Difference]: Finished difference Result 908 states and 2028 transitions. [2022-03-15 17:35:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 17:35:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 17:35:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:22,232 INFO L225 Difference]: With dead ends: 908 [2022-03-15 17:35:22,232 INFO L226 Difference]: Without dead ends: 908 [2022-03-15 17:35:22,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=540, Invalid=4411, Unknown=23, NotChecked=138, Total=5112 [2022-03-15 17:35:22,234 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:22,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 17:35:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-03-15 17:35:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 610. [2022-03-15 17:35:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 2.3092105263157894) internal successors, (1404), 609 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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 17:35:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1404 transitions. [2022-03-15 17:35:22,248 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1404 transitions. Word has length 28 [2022-03-15 17:35:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:22,249 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 1404 transitions. [2022-03-15 17:35:22,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 17:35:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1404 transitions. [2022-03-15 17:35:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 17:35:22,250 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:22,250 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:35:22,272 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 17:35:22,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 17:35:22,473 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 17:35:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1239999792, now seen corresponding path program 2 times [2022-03-15 17:35:22,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:22,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717997532] [2022-03-15 17:35:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:35:22,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:22,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717997532] [2022-03-15 17:35:22,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717997532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:22,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471740084] [2022-03-15 17:35:22,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:35:22,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:22,554 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 17:35:22,579 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 17:35:22,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:35:22,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:35:22,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:35:22,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:35:22,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:35:22,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471740084] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:35:22,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:35:22,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 17:35:22,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101066587] [2022-03-15 17:35:22,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:35:22,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:35:22,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 99 transitions. [2022-03-15 17:35:22,858 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:35:23,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [18383#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 1)), 18387#(or (= (+ ~top~0 1) 800) (<= ~top~0 0) (< 2147483646 ~top~0)), 18389#(or (<= ~top~0 0) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)), 18384#(or (< 2147483647 ~top~0) (<= ~top~0 1)), 18385#(or (< 2147483647 ~top~0) (<= ~top~0 1) (= ~top~0 800)), 18388#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0) (= ~top~0 799) (< 2147483646 ~top~0)), 18386#(or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0))] [2022-03-15 17:35:23,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 17:35:23,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:35:23,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 17:35:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:35:23,398 INFO L87 Difference]: Start difference. First operand 610 states and 1404 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 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 17:35:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:23,920 INFO L93 Difference]: Finished difference Result 1031 states and 2275 transitions. [2022-03-15 17:35:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 17:35:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 17:35:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:23,925 INFO L225 Difference]: With dead ends: 1031 [2022-03-15 17:35:23,925 INFO L226 Difference]: Without dead ends: 1031 [2022-03-15 17:35:23,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 17:35:23,926 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 199 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:23,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 4 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:35:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-03-15 17:35:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 702. [2022-03-15 17:35:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 700 states have (on average 2.357142857142857) internal successors, (1650), 701 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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 17:35:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1650 transitions. [2022-03-15 17:35:23,966 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1650 transitions. Word has length 31 [2022-03-15 17:35:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:23,966 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1650 transitions. [2022-03-15 17:35:23,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 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 17:35:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1650 transitions. [2022-03-15 17:35:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 17:35:23,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:23,968 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-03-15 17:35:23,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 17:35:24,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:24,184 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:35:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash -611964526, now seen corresponding path program 4 times [2022-03-15 17:35:24,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:24,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353903028] [2022-03-15 17:35:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:24,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:24,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353903028] [2022-03-15 17:35:24,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353903028] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:24,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677908807] [2022-03-15 17:35:24,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:35:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:24,312 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 17:35:24,312 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 17:35:24,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:35:24,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:35:24,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:35:24,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:24,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:24,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677908807] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:35:24,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:35:24,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2022-03-15 17:35:24,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061256837] [2022-03-15 17:35:24,657 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:35:24,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:35:24,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2022-03-15 17:35:24,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:35:24,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:35:24,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 17:35:24,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:35:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 17:35:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-03-15 17:35:24,669 INFO L87 Difference]: Start difference. First operand 702 states and 1650 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 17:35:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:24,946 INFO L93 Difference]: Finished difference Result 1078 states and 2443 transitions. [2022-03-15 17:35:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 17:35:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 17:35:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:24,951 INFO L225 Difference]: With dead ends: 1078 [2022-03-15 17:35:24,951 INFO L226 Difference]: Without dead ends: 1078 [2022-03-15 17:35:24,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-03-15 17:35:24,952 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 182 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:24,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 3 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:35:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-03-15 17:35:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 804. [2022-03-15 17:35:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 802 states have (on average 2.3728179551122195) internal successors, (1903), 803 states have internal predecessors, (1903), 0 states have call successors, (0), 0 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 17:35:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1903 transitions. [2022-03-15 17:35:24,973 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1903 transitions. Word has length 34 [2022-03-15 17:35:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:24,973 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1903 transitions. [2022-03-15 17:35:24,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 17:35:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1903 transitions. [2022-03-15 17:35:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 17:35:24,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:24,975 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:35:24,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 17:35:25,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:25,196 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:35:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1050189315, now seen corresponding path program 5 times [2022-03-15 17:35:25,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:25,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083393279] [2022-03-15 17:35:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:27,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:27,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083393279] [2022-03-15 17:35:27,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083393279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:27,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085583530] [2022-03-15 17:35:27,081 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:35:27,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:27,082 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 17:35:27,083 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 17:35:27,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:35:27,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:35:27,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 17:35:27,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:27,221 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:35:27,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:35:27,601 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 22 treesize of output 18 [2022-03-15 17:35:27,715 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 76 treesize of output 70 [2022-03-15 17:35:28,442 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 128 treesize of output 56 [2022-03-15 17:35:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:35:59,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:59,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_624) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:35:59,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:59,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:35:59,892 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:35:59,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:35:59,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:36:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:36:00,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085583530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:36:00,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:36:00,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 54 [2022-03-15 17:36:00,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425063830] [2022-03-15 17:36:00,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:36:00,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:36:00,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 53 transitions. [2022-03-15 17:36:00,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:36:01,546 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:36:01,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 17:36:01,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:36:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 17:36:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2644, Unknown=15, NotChecked=106, Total=3080 [2022-03-15 17:36:01,547 INFO L87 Difference]: Start difference. First operand 804 states and 1903 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 17:36:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:36:22,959 INFO L93 Difference]: Finished difference Result 1234 states and 2799 transitions. [2022-03-15 17:36:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 17:36:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 17:36:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:36:22,966 INFO L225 Difference]: With dead ends: 1234 [2022-03-15 17:36:22,966 INFO L226 Difference]: Without dead ends: 1234 [2022-03-15 17:36:22,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2128 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=941, Invalid=6019, Unknown=16, NotChecked=164, Total=7140 [2022-03-15 17:36:22,968 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 398 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:36:22,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 0 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 17:36:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-15 17:36:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2022-03-15 17:36:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 782 states have (on average 2.363171355498721) internal successors, (1848), 783 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 17:36:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1848 transitions. [2022-03-15 17:36:22,987 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1848 transitions. Word has length 35 [2022-03-15 17:36:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:36:22,988 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1848 transitions. [2022-03-15 17:36:22,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 17:36:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1848 transitions. [2022-03-15 17:36:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:36:22,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:36:22,989 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:36:23,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 17:36:23,209 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,SelfDestructingSolverStorable14 [2022-03-15 17:36:23,210 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 17:36:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:36:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1198232037, now seen corresponding path program 1 times [2022-03-15 17:36:23,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:36:23,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491080460] [2022-03-15 17:36:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:36:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:36:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:36:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:36:24,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:36:24,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491080460] [2022-03-15 17:36:24,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491080460] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:36:24,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179836475] [2022-03-15 17:36:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:36:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:36:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:36:24,134 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 17:36:24,135 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 17:36:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:36:24,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 17:36:24,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:36:24,529 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 22 treesize of output 18 [2022-03-15 17:36:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:36:25,031 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 90 treesize of output 53 [2022-03-15 17:36:25,995 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 128 treesize of output 56 [2022-03-15 17:36:28,337 WARN L860 $PredicateComparison]: unable to prove that (exists ((aux_mod_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95 Int) (aux_div_aux_mod_v_arrayElimCell_18_53_117 Int) (aux_div_v_arrayElimCell_18_53 Int) (aux_div_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95 Int)) (let ((.cse1 (* 8589934592 aux_div_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95)) (.cse2 (* aux_mod_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95 4294967296))) (let ((.cse3 (+ .cse1 .cse2 aux_mod_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140)) (.cse0 (* aux_div_v_arrayElimCell_18_53 4294967296))) (and (< .cse0 (+ 2147483649 .cse1 .cse2 aux_mod_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140)) (<= (+ (* aux_div_v_arrayElimCell_18_53 8589934592) 2147482848) .cse3) (<= .cse3 (+ 2147483647 .cse0)) (< aux_div_aux_mod_v_arrayElimCell_18_53_117 (+ aux_div_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95 1)) (<= .cse3 (+ 2147483647 (* aux_div_aux_mod_v_arrayElimCell_18_53_117 4294967296) .cse0)) (= |c_t2Thread1of1ForFork1_#t~ret45#1| (mod (+ 2147483647 (* 4294967295 aux_mod_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140)) 4294967296)) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140_95) (<= 0 aux_mod_aux_mod_aux_mod_v_arrayElimCell_18_53_117_140))))) is different from true [2022-03-15 17:36:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 17:36:28,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:36:30,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_151| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_151| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_151|)) v_ArrVal_692)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:36:31,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_113| Int) (v_ArrVal_692 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_151| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_151|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_113|) v_ArrVal_692)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_113|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_151| c_~top~0))) is different from false [2022-03-15 17:36:44,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 17:36:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 17:36:44,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179836475] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:36:44,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:36:44,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 62 [2022-03-15 17:36:44,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146927454] [2022-03-15 17:36:44,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:36:44,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:36:44,674 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 104 transitions. [2022-03-15 17:36:44,674 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:36:48,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [27166#(and (or (< (* ~top~0 4) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0))), 27158#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 4) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))) (or (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (< (* ~top~0 4) 4) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))))), 27161#(and (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800)) (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800))), 27163#(and (or (= (+ ~top~0 1) 800) (< (* ~top~0 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (< (* ~top~0 4) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0))), 27160#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= ~top~0 800)) (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4)))) (= ~top~0 800)) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4)))) (= ~top~0 800)) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800)) (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800))), 27165#(and (or (< (* ~top~0 4) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)) (<= |t1Thread1of1ForFork0_push_~x#1| 799) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= ~top~0 799) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 799) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (= ~top~0 799) (< 2147483646 ~top~0))), 27167#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800) (= ~top~0 799) (< 2147483646 ~top~0)), 27162#(and (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0)) (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 799)) (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0))), 27159#(and (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 27164#(and (or (= (+ ~top~0 1) 800) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 0) (and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0)))] [2022-03-15 17:36:48,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 17:36:48,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:36:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 17:36:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=4552, Unknown=3, NotChecked=414, Total=5256 [2022-03-15 17:36:48,867 INFO L87 Difference]: Start difference. First operand 784 states and 1848 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 17:37:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:37:24,833 INFO L93 Difference]: Finished difference Result 2698 states and 6141 transitions. [2022-03-15 17:37:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 17:37:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 17:37:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:37:24,841 INFO L225 Difference]: With dead ends: 2698 [2022-03-15 17:37:24,841 INFO L226 Difference]: Without dead ends: 2698 [2022-03-15 17:37:24,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 174 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8910 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=2608, Invalid=27157, Unknown=3, NotChecked=1032, Total=30800 [2022-03-15 17:37:24,847 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 807 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:37:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 0 Invalid, 4933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-03-15 17:37:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2022-03-15 17:37:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 1486. [2022-03-15 17:37:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1484 states have (on average 2.509433962264151) internal successors, (3724), 1485 states have internal predecessors, (3724), 0 states have call successors, (0), 0 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 17:37:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 3724 transitions. [2022-03-15 17:37:24,884 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 3724 transitions. Word has length 36 [2022-03-15 17:37:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:37:24,884 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 3724 transitions. [2022-03-15 17:37:24,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 17:37:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 3724 transitions. [2022-03-15 17:37:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:37:24,886 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:37:24,887 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:37:24,912 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 17:37:25,099 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,SelfDestructingSolverStorable15 [2022-03-15 17:37:25,099 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:37:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:37:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -824440315, now seen corresponding path program 2 times [2022-03-15 17:37:25,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:37:25,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897908495] [2022-03-15 17:37:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:37:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:37:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:37:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:37:26,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:37:26,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897908495] [2022-03-15 17:37:26,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897908495] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:37:26,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883993657] [2022-03-15 17:37:26,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:37:26,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:37:26,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:37:26,471 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 17:37:26,473 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 17:37:26,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:37:26,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:37:26,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 17:37:26,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:37:26,620 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:37:26,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:37:26,993 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 22 treesize of output 18 [2022-03-15 17:37:27,091 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 76 treesize of output 70 [2022-03-15 17:37:27,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:37:27,741 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 65 treesize of output 48 [2022-03-15 17:37:28,759 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 92 treesize of output 56 [2022-03-15 17:37:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:37:49,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:38:33,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_760) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:38:33,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:33,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:38:33,134 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:38:33,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:38:33,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:38:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:33,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883993657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:38:33,480 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:38:33,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 61 [2022-03-15 17:38:33,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287862764] [2022-03-15 17:38:33,480 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:38:33,484 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:38:33,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 17:38:33,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:38:43,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [33317#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 799))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 799))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 799))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 799)))), 33319#(and (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= ~top~0 800) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800))), 33318#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (= |~#arr~0.offset| 0) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 799) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 799) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))))] [2022-03-15 17:38:43,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 17:38:43,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:38:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 17:38:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3792, Unknown=14, NotChecked=126, Total=4290 [2022-03-15 17:38:43,473 INFO L87 Difference]: Start difference. First operand 1486 states and 3724 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 17:38:51,164 WARN L228 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 186 DAG size of output: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 17:38:59,294 WARN L228 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 190 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 17:39:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:20,651 INFO L93 Difference]: Finished difference Result 2126 states and 5056 transitions. [2022-03-15 17:39:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 17:39:20,652 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 17:39:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:20,659 INFO L225 Difference]: With dead ends: 2126 [2022-03-15 17:39:20,659 INFO L226 Difference]: Without dead ends: 1976 [2022-03-15 17:39:20,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 99.4s TimeCoverageRelationStatistics Valid=838, Invalid=7162, Unknown=14, NotChecked=176, Total=8190 [2022-03-15 17:39:20,660 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 317 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:20,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 5 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-03-15 17:39:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2022-03-15 17:39:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1581. [2022-03-15 17:39:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1579 states have (on average 2.4863837872070933) internal successors, (3926), 1580 states have internal predecessors, (3926), 0 states have call successors, (0), 0 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 17:39:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3926 transitions. [2022-03-15 17:39:20,692 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3926 transitions. Word has length 36 [2022-03-15 17:39:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:20,692 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 3926 transitions. [2022-03-15 17:39:20,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 17:39:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3926 transitions. [2022-03-15 17:39:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:39:20,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:20,694 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:39:20,719 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 17:39:20,917 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,SelfDestructingSolverStorable16 [2022-03-15 17:39:20,917 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 17:39:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 941284393, now seen corresponding path program 3 times [2022-03-15 17:39:20,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:20,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445578447] [2022-03-15 17:39:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:21,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:21,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445578447] [2022-03-15 17:39:21,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445578447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:21,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103242350] [2022-03-15 17:39:21,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:39:21,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:21,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:21,516 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 17:39:21,517 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 17:39:21,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:39:21,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:21,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 17:39:21,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:21,652 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:39:21,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:39:21,951 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 22 treesize of output 18 [2022-03-15 17:39:22,163 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 56 treesize of output 50 [2022-03-15 17:39:22,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:39:22,487 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 65 treesize of output 48 [2022-03-15 17:39:23,432 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 92 treesize of output 56 [2022-03-15 17:40:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:40:04,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:40:10,551 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_830 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_830) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:40:10,559 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_830 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_830) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2022-03-15 17:40:10,567 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_830 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_830) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:40:10,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:40:10,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:40:10,583 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:40:10,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:40:10,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:40:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 17:40:10,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103242350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:40:10,937 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:40:10,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 61 [2022-03-15 17:40:10,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [206117427] [2022-03-15 17:40:10,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:40:10,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:40:10,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 17:40:10,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:40:13,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [38932#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= |t1Thread1of1ForFork0_push_~x#1| 799))), 38934#(and (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800)) (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 800))), 38933#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 799) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4)))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4)))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (= ~top~0 800) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 38936#(and (or (= (+ ~top~0 1) 800) (< (+ 2147483649 ~top~0) 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (< (+ 2147483649 ~top~0) 0) (< 2147483646 ~top~0)) (or (= (+ ~top~0 1) 800) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (< 2147483646 ~top~0))), 38938#(and (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 799) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))), 38935#(and (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0)) (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0)) (or (= 800 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 799))), 38937#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 799)), 38931#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 799)) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 799)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))))] [2022-03-15 17:40:13,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 17:40:13,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:40:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 17:40:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=4240, Unknown=24, NotChecked=402, Total=4970 [2022-03-15 17:40:13,158 INFO L87 Difference]: Start difference. First operand 1581 states and 3926 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 17:40:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:40:23,599 INFO L93 Difference]: Finished difference Result 2382 states and 5605 transitions. [2022-03-15 17:40:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 17:40:23,600 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 17:40:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:40:23,609 INFO L225 Difference]: With dead ends: 2382 [2022-03-15 17:40:23,609 INFO L226 Difference]: Without dead ends: 2382 [2022-03-15 17:40:23,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=1411, Invalid=11685, Unknown=26, NotChecked=684, Total=13806 [2022-03-15 17:40:23,611 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 596 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:40:23,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 0 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 17:40:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2022-03-15 17:40:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 1639. [2022-03-15 17:40:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1637 states have (on average 2.4917532070861332) internal successors, (4079), 1638 states have internal predecessors, (4079), 0 states have call successors, (0), 0 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 17:40:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 4079 transitions. [2022-03-15 17:40:23,648 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 4079 transitions. Word has length 36 [2022-03-15 17:40:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:40:23,648 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 4079 transitions. [2022-03-15 17:40:23,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 17:40:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 4079 transitions. [2022-03-15 17:40:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:40:23,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:40:23,651 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:40:23,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 17:40:23,874 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,SelfDestructingSolverStorable17 [2022-03-15 17:40:23,874 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:40:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:40:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash -217993061, now seen corresponding path program 4 times [2022-03-15 17:40:23,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:40:23,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128371610] [2022-03-15 17:40:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:40:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:40:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:40:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:40:24,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:40:24,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128371610] [2022-03-15 17:40:24,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128371610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:40:24,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27033544] [2022-03-15 17:40:24,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:40:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:40:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:40:24,753 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 17:40:24,753 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 17:40:24,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:40:24,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:40:24,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 17:40:24,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:40:24,908 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:40:24,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:40:25,251 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 22 treesize of output 18 [2022-03-15 17:40:25,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:40:25,789 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 65 treesize of output 48 [2022-03-15 17:40:25,969 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 56 treesize of output 50 [2022-03-15 17:40:26,954 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 92 treesize of output 56 [2022-03-15 17:40:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:40:59,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:41:00,232 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ (- 1) c_~top~0) 0) (forall ((v_ArrVal_902 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) is different from false [2022-03-15 17:41:00,241 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_902 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))) 4294967296)))) (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)) is different from false [2022-03-15 17:41:00,249 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_902 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:41:00,258 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_900 Int)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:41:00,274 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_900 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (not (= (mod (select (select (store (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_203|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-15 17:41:00,311 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_900 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (not (= (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|))))) is different from false [2022-03-15 17:41:00,346 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_900 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_145| |c_~#arr~0.offset|)))) is different from false [2022-03-15 17:41:00,411 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_900 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_145| |c_~#arr~0.offset|))) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) is different from false [2022-03-15 17:41:00,446 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_902 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_900 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| (+ c_~top~0 1)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_900)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_902) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_145| |c_~#arr~0.offset|)))) is different from false [2022-03-15 17:41:00,481 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:41:00,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 60 [2022-03-15 17:41:00,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:41:00,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 70 [2022-03-15 17:41:00,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:41:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-03-15 17:41:00,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27033544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:41:00,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:41:00,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 22] total 69 [2022-03-15 17:41:00,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757010000] [2022-03-15 17:41:00,908 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:41:00,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:41:00,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 54 transitions. [2022-03-15 17:41:00,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:41:01,096 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [44974#(and (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 799))] [2022-03-15 17:41:01,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 17:41:01,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:41:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 17:41:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=3631, Unknown=23, NotChecked=1170, Total=5112 [2022-03-15 17:41:01,097 INFO L87 Difference]: Start difference. First operand 1639 states and 4079 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 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 17:41:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:41:05,077 INFO L93 Difference]: Finished difference Result 2204 states and 5238 transitions. [2022-03-15 17:41:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 17:41:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 17:41:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:41:05,085 INFO L225 Difference]: With dead ends: 2204 [2022-03-15 17:41:05,085 INFO L226 Difference]: Without dead ends: 2204 [2022-03-15 17:41:05,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=858, Invalid=8275, Unknown=23, NotChecked=1764, Total=10920 [2022-03-15 17:41:05,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 474 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:41:05,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 0 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 17:41:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2022-03-15 17:41:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1656. [2022-03-15 17:41:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1654 states have (on average 2.494558645707376) internal successors, (4126), 1655 states have internal predecessors, (4126), 0 states have call successors, (0), 0 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 17:41:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4126 transitions. [2022-03-15 17:41:05,120 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4126 transitions. Word has length 36 [2022-03-15 17:41:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:41:05,120 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 4126 transitions. [2022-03-15 17:41:05,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 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 17:41:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4126 transitions. [2022-03-15 17:41:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 17:41:05,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:41:05,123 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:41:05,151 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 17:41:05,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:05,346 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:41:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:41:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1321323465, now seen corresponding path program 3 times [2022-03-15 17:41:05,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:41:05,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901234959] [2022-03-15 17:41:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:41:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:41:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:41:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:41:05,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:41:05,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901234959] [2022-03-15 17:41:05,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901234959] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:41:05,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53165203] [2022-03-15 17:41:05,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:41:05,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:41:05,476 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 17:41:05,480 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 17:41:05,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:41:05,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:41:05,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 17:41:05,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:41:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 17:41:05,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:41:05,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53165203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:41:05,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:41:05,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-03-15 17:41:05,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624019121] [2022-03-15 17:41:05,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:41:05,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:41:05,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 134 transitions. [2022-03-15 17:41:05,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:41:05,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:41:05,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:41:05,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:41:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:41:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:41:05,941 INFO L87 Difference]: Start difference. First operand 1656 states and 4126 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 17:41:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:41:06,116 INFO L93 Difference]: Finished difference Result 1918 states and 4697 transitions. [2022-03-15 17:41:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:41:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 17:41:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:41:06,121 INFO L225 Difference]: With dead ends: 1918 [2022-03-15 17:41:06,121 INFO L226 Difference]: Without dead ends: 1918 [2022-03-15 17:41:06,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:41:06,122 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:41:06,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 2 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:41:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-03-15 17:41:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1668. [2022-03-15 17:41:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1666 states have (on average 2.4993997599039615) internal successors, (4164), 1667 states have internal predecessors, (4164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:41:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4164 transitions. [2022-03-15 17:41:06,154 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4164 transitions. Word has length 38 [2022-03-15 17:41:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:41:06,154 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 4164 transitions. [2022-03-15 17:41:06,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 17:41:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4164 transitions. [2022-03-15 17:41:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 17:41:06,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:41:06,156 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:41:06,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 17:41:06,371 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,SelfDestructingSolverStorable19 [2022-03-15 17:41:06,371 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:41:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:41:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -357370697, now seen corresponding path program 4 times [2022-03-15 17:41:06,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:41:06,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876955014] [2022-03-15 17:41:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:41:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:41:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:41:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:41:06,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:41:06,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876955014] [2022-03-15 17:41:06,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876955014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:41:06,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902469439] [2022-03-15 17:41:06,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:41:06,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:41:06,516 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 17:41:06,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 17:41:06,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:41:06,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:41:06,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:41:06,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:41:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:41:06,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:41:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:41:06,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902469439] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:41:06,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:41:06,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-03-15 17:41:06,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796709645] [2022-03-15 17:41:06,863 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:41:06,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:41:06,882 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 78 transitions. [2022-03-15 17:41:06,882 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:41:07,100 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [56191#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0)), 56192#(or (< 2147483647 ~top~0) (<= ~top~0 0)), 56193#(or (< 2147483647 ~top~0) (<= ~top~0 0) (= ~top~0 800))] [2022-03-15 17:41:07,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 17:41:07,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:41:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 17:41:07,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:41:07,100 INFO L87 Difference]: Start difference. First operand 1668 states and 4164 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 17:41:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:41:07,535 INFO L93 Difference]: Finished difference Result 2186 states and 5245 transitions. [2022-03-15 17:41:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 17:41:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-03-15 17:41:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:41:07,541 INFO L225 Difference]: With dead ends: 2186 [2022-03-15 17:41:07,541 INFO L226 Difference]: Without dead ends: 2186 [2022-03-15 17:41:07,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2022-03-15 17:41:07,542 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 199 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:41:07,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 3 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:41:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2022-03-15 17:41:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1668. [2022-03-15 17:41:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1666 states have (on average 2.4993997599039615) internal successors, (4164), 1667 states have internal predecessors, (4164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:41:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4164 transitions. [2022-03-15 17:41:07,574 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4164 transitions. Word has length 38 [2022-03-15 17:41:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:41:07,574 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 4164 transitions. [2022-03-15 17:41:07,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 17:41:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4164 transitions. [2022-03-15 17:41:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 17:41:07,577 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:41:07,577 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-03-15 17:41:07,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 17:41:07,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:07,791 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:41:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:41:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 48552593, now seen corresponding path program 5 times [2022-03-15 17:41:07,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:41:07,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77321515] [2022-03-15 17:41:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:41:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:41:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:41:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:41:07,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:41:07,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77321515] [2022-03-15 17:41:07,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77321515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:41:07,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493582163] [2022-03-15 17:41:07,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:41:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:41:07,972 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:41:07,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 17:41:08,143 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 17:41:08,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:41:08,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:41:08,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:41:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:41:08,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:41:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:41:08,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493582163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:41:08,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:41:08,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 29 [2022-03-15 17:41:08,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758437569] [2022-03-15 17:41:08,432 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:41:08,439 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:41:08,448 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 41 transitions. [2022-03-15 17:41:08,448 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:41:08,449 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:41:08,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 17:41:08,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:41:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 17:41:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2022-03-15 17:41:08,450 INFO L87 Difference]: Start difference. First operand 1668 states and 4164 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 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 17:41:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:41:08,781 INFO L93 Difference]: Finished difference Result 2343 states and 5642 transitions. [2022-03-15 17:41:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:41:08,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 17:41:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:41:08,785 INFO L225 Difference]: With dead ends: 2343 [2022-03-15 17:41:08,785 INFO L226 Difference]: Without dead ends: 2343 [2022-03-15 17:41:08,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=365, Invalid=895, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 17:41:08,788 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 285 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:41:08,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 4 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:41:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-03-15 17:41:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1824. [2022-03-15 17:41:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 2.5021953896816687) internal successors, (4559), 1823 states have internal predecessors, (4559), 0 states have call successors, (0), 0 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 17:41:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4559 transitions. [2022-03-15 17:41:08,839 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4559 transitions. Word has length 41 [2022-03-15 17:41:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:41:08,839 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 4559 transitions. [2022-03-15 17:41:08,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 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 17:41:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4559 transitions. [2022-03-15 17:41:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 17:41:08,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:41:08,843 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:41:08,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 17:41:09,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:09,067 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:41:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:41:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2048995106, now seen corresponding path program 6 times [2022-03-15 17:41:09,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:41:09,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982412677] [2022-03-15 17:41:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:41:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:41:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:41:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:41:12,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:41:12,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982412677] [2022-03-15 17:41:12,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982412677] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:41:12,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653685245] [2022-03-15 17:41:12,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:41:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:41:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:41:12,707 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:41:12,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 17:41:12,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 17:41:12,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:41:12,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 17:41:12,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:41:12,853 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:41:12,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-03-15 17:41:13,318 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 22 treesize of output 18 [2022-03-15 17:41:13,422 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 76 treesize of output 70 [2022-03-15 17:41:14,252 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 128 treesize of output 56 [2022-03-15 17:41:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:41:59,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:00,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1226) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-03-15 17:42:00,011 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:42:00,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:42:00,021 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:42:00,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:42:00,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:42:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:42:00,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653685245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:00,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:00,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 60 [2022-03-15 17:42:00,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032026339] [2022-03-15 17:42:00,501 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:00,509 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:00,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 60 transitions. [2022-03-15 17:42:00,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:02,356 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:42:02,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 17:42:02,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 17:42:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=3288, Unknown=21, NotChecked=118, Total=3782 [2022-03-15 17:42:02,357 INFO L87 Difference]: Start difference. First operand 1824 states and 4559 transitions. Second operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 17:43:01,638 WARN L228 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 147 DAG size of output: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 17:43:09,513 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 158 DAG size of output: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 17:43:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:43:10,105 INFO L93 Difference]: Finished difference Result 2621 states and 6252 transitions. [2022-03-15 17:43:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 17:43:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 17:43:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:43:10,111 INFO L225 Difference]: With dead ends: 2621 [2022-03-15 17:43:10,111 INFO L226 Difference]: Without dead ends: 2621 [2022-03-15 17:43:10,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3291 ImplicationChecksByTransitivity, 107.1s TimeCoverageRelationStatistics Valid=1216, Invalid=8469, Unknown=21, NotChecked=194, Total=9900 [2022-03-15 17:43:10,116 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 502 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:43:10,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 0 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-03-15 17:43:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2022-03-15 17:43:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 1804. [2022-03-15 17:43:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 2.4994450610432852) internal successors, (4504), 1803 states have internal predecessors, (4504), 0 states have call successors, (0), 0 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 17:43:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4504 transitions. [2022-03-15 17:43:10,148 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4504 transitions. Word has length 42 [2022-03-15 17:43:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:43:10,149 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 4504 transitions. [2022-03-15 17:43:10,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 17:43:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4504 transitions. [2022-03-15 17:43:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:43:10,151 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:43:10,151 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:43:10,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 17:43:10,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 17:43:10,367 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:43:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:43:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1722648764, now seen corresponding path program 5 times [2022-03-15 17:43:10,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:43:10,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389180381] [2022-03-15 17:43:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:43:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:43:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:43:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:43:14,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:43:14,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389180381] [2022-03-15 17:43:14,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389180381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:43:14,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295141491] [2022-03-15 17:43:14,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:43:14,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:43:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:43:14,035 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 17:43:14,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 17:43:14,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:43:14,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:43:14,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 100 conjunts are in the unsatisfiable core [2022-03-15 17:43:14,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:43:14,208 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 17:43:14,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 17:43:14,795 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 22 treesize of output 18 [2022-03-15 17:43:14,928 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 76 treesize of output 70 [2022-03-15 17:43:15,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:43:15,684 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 75 treesize of output 50 [2022-03-15 17:43:17,412 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 92 treesize of output 56 [2022-03-15 17:44:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:44:25,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:44:28,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_266| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_266|)) v_ArrVal_1308)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_266| c_~top~0))) is different from false [2022-03-15 17:44:29,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_189| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_266| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_189| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_266|)) v_ArrVal_1308)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_266| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_189|)))) is different from false [2022-03-15 17:45:19,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1307) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:45:19,140 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:45:19,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-03-15 17:45:19,149 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:45:19,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-03-15 17:45:19,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-03-15 17:45:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-03-15 17:45:19,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295141491] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:45:19,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:45:19,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 20] total 70 [2022-03-15 17:45:19,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047458127] [2022-03-15 17:45:19,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:45:19,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:45:19,662 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 95 transitions. [2022-03-15 17:45:19,662 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:45:34,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [74942#(and (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= ~top~0 800) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (= ~top~0 800) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (= ~top~0 800)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (= ~top~0 800) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))), 74940#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (<= (+ 8 (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (+ |~#arr~0.offset| (* ~top~0 4))) (and (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))), 74941#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= ((as const (Array Int Int)) 0) (store (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4)))) (or (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= 0 (+ ~top~0 2147483648))) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 2147483647) (<= (+ (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (+ (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 2147483647) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (not (= (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (+ (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 8) (+ |~#arr~0.offset| (* ~top~0 4))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))] [2022-03-15 17:45:34,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 17:45:34,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:45:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 17:45:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=4761, Unknown=36, NotChecked=426, Total=5550 [2022-03-15 17:45:34,557 INFO L87 Difference]: Start difference. First operand 1804 states and 4504 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 17:47:09,777 WARN L228 SmtUtils]: Spent 44.79s on a formula simplification. DAG size of input: 244 DAG size of output: 202 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 17:48:06,096 WARN L228 SmtUtils]: Spent 45.75s on a formula simplification. DAG size of input: 218 DAG size of output: 176 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-03-15 17:48:09,562 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 17:48:09,562 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 17:48:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 17:48:10,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2882 ImplicationChecksByTransitivity, 274.1s TimeCoverageRelationStatistics Valid=1102, Invalid=9176, Unknown=36, NotChecked=606, Total=10920 [2022-03-15 17:48:10,108 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 378 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:48:10,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 0 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-03-15 17:48:10,110 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:48:10,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 17:48:10,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:48:10,311 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1804states) and FLOYD_HOARE automaton (currently 33 states, 32 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. [2022-03-15 17:48:10,312 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 17:48:10,312 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:48:10,312 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 17:48:10,312 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 17:48:10,312 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:48:10,314 INFO L732 BasicCegarLoop]: Path program histogram: [6, 5, 5, 4, 1, 1, 1, 1] [2022-03-15 17:48:10,316 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:48:10,316 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:48:10,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:48:10 BasicIcfg [2022-03-15 17:48:10,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:48:10,318 INFO L158 Benchmark]: Toolchain (without parser) took 842878.01ms. Allocated memory was 175.1MB in the beginning and 354.4MB in the end (delta: 179.3MB). Free memory was 116.4MB in the beginning and 154.4MB in the end (delta: -37.9MB). Peak memory consumption was 142.2MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,318 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:48:10,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.44ms. Allocated memory was 175.1MB in the beginning and 245.4MB in the end (delta: 70.3MB). Free memory was 116.2MB in the beginning and 200.5MB in the end (delta: -84.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.83ms. Allocated memory is still 245.4MB. Free memory was 200.5MB in the beginning and 197.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,318 INFO L158 Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 245.4MB. Free memory was 197.3MB in the beginning and 195.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,319 INFO L158 Benchmark]: RCFGBuilder took 410.07ms. Allocated memory is still 245.4MB. Free memory was 195.2MB in the beginning and 179.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,319 INFO L158 Benchmark]: TraceAbstraction took 841865.84ms. Allocated memory was 245.4MB in the beginning and 354.4MB in the end (delta: 109.1MB). Free memory was 178.4MB in the beginning and 154.4MB in the end (delta: 24.1MB). Peak memory consumption was 134.7MB. Max. memory is 8.0GB. [2022-03-15 17:48:10,320 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.11ms. Allocated memory is still 175.1MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.44ms. Allocated memory was 175.1MB in the beginning and 245.4MB in the end (delta: 70.3MB). Free memory was 116.2MB in the beginning and 200.5MB in the end (delta: -84.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.83ms. Allocated memory is still 245.4MB. Free memory was 200.5MB in the beginning and 197.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.35ms. Allocated memory is still 245.4MB. Free memory was 197.3MB in the beginning and 195.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 410.07ms. Allocated memory is still 245.4MB. Free memory was 195.2MB in the beginning and 179.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 841865.84ms. Allocated memory was 245.4MB in the beginning and 354.4MB in the end (delta: 109.1MB). Free memory was 178.4MB in the beginning and 154.4MB in the end (delta: 24.1MB). Peak memory consumption was 134.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 169 PlacesBefore, 39 PlacesAfterwards, 172 TransitionsBefore, 37 TransitionsAfterwards, 8324 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 24 ConcurrentYvCompositions, 5 ChoiceCompositions, 165 TotalNumberOfCompositions, 11337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9084, positive: 8899, positive conditional: 0, positive unconditional: 8899, negative: 185, negative conditional: 0, negative unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4852, positive: 4789, positive conditional: 0, positive unconditional: 4789, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9084, positive: 4110, positive conditional: 0, positive unconditional: 4110, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 4852, unknown conditional: 0, unknown unconditional: 4852] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - 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: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (1804states) and FLOYD_HOARE automaton (currently 33 states, 32 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. - 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 BasicCegarLoop was constructing difference of abstraction (1804states) and FLOYD_HOARE automaton (currently 33 states, 32 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. - 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 BasicCegarLoop was constructing difference of abstraction (1804states) and FLOYD_HOARE automaton (currently 33 states, 32 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (1804states) and FLOYD_HOARE automaton (currently 33 states, 32 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 272 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 841.7s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 344.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5661 SdHoareTripleChecker+Valid, 41.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5661 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 37.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9131 mSDsCounter, 1181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20720 IncrementalHoareTripleChecker+Invalid, 21901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1181 mSolverCounterUnsat, 16 mSDtfsCounter, 20720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2113 GetRequests, 940 SyntacticMatches, 63 SemanticMatches, 1109 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 27857 ImplicationChecksByTransitivity, 739.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1824occurred in iteration=22, InterpolantAutomatonStates: 502, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 7515 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 446.3s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1675 ConstructedInterpolants, 44 QuantifiedInterpolants, 52562 SizeOfPredicates, 294 NumberOfNonLiveVariables, 5150 ConjunctsInSsa, 691 ConjunctsInUnsatCore, 56 InterpolantComputations, 9 PerfectInterpolantSequences, 235/1234 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