/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:41,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:41,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:41,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:41,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:41,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:41,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:41,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:41,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:41,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:41,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:41,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:41,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:41,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:41,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:41,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:41,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:41,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:41,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:41,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:41,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:41,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:41,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:41,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:41,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:41,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:41,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:41,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:41,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:41,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:41,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:41,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:41,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:41,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:41,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:41,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:41,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:41,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:41,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:41,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:41,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:41,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:41,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:31:41,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:41,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:41,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:41,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:41,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:41,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:41,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:41,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:41,226 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:41,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:41,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:41,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:41,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:41,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:41,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:41,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:41,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:41,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:41,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:41,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:41,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:41,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:41,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:31:41,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:41,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:41,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:41,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:41,527 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:41,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-27 10:31:41,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42826f96f/ee7e74de3d8c4ea0abacf3fbb4c4a6d6/FLAGbcf622687 [2022-04-27 10:31:41,964 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:41,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-27 10:31:41,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42826f96f/ee7e74de3d8c4ea0abacf3fbb4c4a6d6/FLAGbcf622687 [2022-04-27 10:31:42,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42826f96f/ee7e74de3d8c4ea0abacf3fbb4c4a6d6 [2022-04-27 10:31:42,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:42,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:42,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:42,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:42,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:42,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750078d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42, skipping insertion in model container [2022-04-27 10:31:42,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:42,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:42,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-04-27 10:31:42,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:42,604 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:42,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c[325,338] [2022-04-27 10:31:42,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:42,646 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:42,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42 WrapperNode [2022-04-27 10:31:42,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:42,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:42,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:42,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:42,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:42,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:42,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:42,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:42,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (1/1) ... [2022-04-27 10:31:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:42,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:42,713 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-04-27 10:31:42,740 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-04-27 10:31:42,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:42,758 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:42,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-27 10:31:42,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:42,812 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:42,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:42,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:42,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:42,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:42,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:42 BoogieIcfgContainer [2022-04-27 10:31:42,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:42,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:42,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:42,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:42,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:42" (1/3) ... [2022-04-27 10:31:42,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a8ea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:42, skipping insertion in model container [2022-04-27 10:31:42,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:42" (2/3) ... [2022-04-27 10:31:42,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a8ea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:42, skipping insertion in model container [2022-04-27 10:31:42,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:42" (3/3) ... [2022-04-27 10:31:42,926 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2022-04-27 10:31:42,943 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:42,943 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:42,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:42,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@602025ed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b4a2e9a [2022-04-27 10:31:42,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:43,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:43,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:43,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 1 times [2022-04-27 10:31:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:43,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162093980] [2022-04-27 10:31:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:43,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:43,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 10:31:43,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:31:43,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-27 10:31:43,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:43,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 10:31:43,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:31:43,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-27 10:31:43,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-27 10:31:43,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2022-04-27 10:31:43,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 10:31:43,187 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27#false} is VALID [2022-04-27 10:31:43,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 10:31:43,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 10:31:43,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 10:31:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162093980] [2022-04-27 10:31:43,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162093980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:43,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:43,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405499709] [2022-04-27 10:31:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:43,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:43,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:43,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:43,285 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:43,407 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 10:31:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:31:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:31:43,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 10:31:43,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:43,508 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:31:43,508 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:31:43,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-27 10:31:43,519 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:43,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:31:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:31:43,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:43,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:43,564 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:43,564 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:43,571 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 10:31:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:43,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:43,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:43,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:31:43,572 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:31:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:43,575 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 10:31:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:43,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:43,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:43,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:43,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 10:31:43,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-27 10:31:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:43,580 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 10:31:43,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:43,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:43,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:43,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 1 times [2022-04-27 10:31:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:43,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13876906] [2022-04-27 10:31:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:43,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:31:43,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:31:43,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2022-04-27 10:31:43,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:43,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:31:43,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:31:43,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2022-04-27 10:31:43,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret5 := main(); {139#true} is VALID [2022-04-27 10:31:43,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} ~x~0 := 0; {144#(= main_~x~0 0)} is VALID [2022-04-27 10:31:43,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {140#false} is VALID [2022-04-27 10:31:43,764 INFO L272 TraceCheckUtils]: 7: Hoare triple {140#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {140#false} is VALID [2022-04-27 10:31:43,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 10:31:43,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 10:31:43,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 10:31:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:43,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13876906] [2022-04-27 10:31:43,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13876906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:43,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:43,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188172180] [2022-04-27 10:31:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:43,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:43,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:43,786 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:43,963 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 10:31:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:43,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 10:31:43,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:44,001 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:31:44,002 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:31:44,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:44,009 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:44,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:31:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-27 10:31:44,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:44,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:44,019 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:44,020 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:44,024 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:31:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 10:31:44,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:44,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:44,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:31:44,025 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:31:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:44,030 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:31:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 10:31:44,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:44,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:44,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:44,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 10:31:44,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-27 10:31:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:44,039 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 10:31:44,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:31:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:31:44,040 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:44,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:44,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:44,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 1 times [2022-04-27 10:31:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:44,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642129349] [2022-04-27 10:31:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:44,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:44,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:31:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:44,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:44,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:44,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:44,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:44,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:44,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:44,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:44,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:44,289 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:44,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:44,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:44,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {257#false} is VALID [2022-04-27 10:31:44,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {257#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {257#false} is VALID [2022-04-27 10:31:44,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 10:31:44,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:44,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:44,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642129349] [2022-04-27 10:31:44,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642129349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:44,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873244653] [2022-04-27 10:31:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:44,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:44,307 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-04-27 10:31:44,308 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-04-27 10:31:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:44,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 10:31:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:44,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:44,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 10:31:44,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:44,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:44,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:44,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:44,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:44,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:44,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:44,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:44,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:44,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:44,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {257#false} is VALID [2022-04-27 10:31:44,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {257#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {257#false} is VALID [2022-04-27 10:31:44,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 10:31:44,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:44,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:44,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:44,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:44,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:44,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 10:31:44,931 INFO L272 TraceCheckUtils]: 13: Hoare triple {257#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {257#false} is VALID [2022-04-27 10:31:44,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {333#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {257#false} is VALID [2022-04-27 10:31:44,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#(< (mod |main_#t~ret4| 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {333#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 10:31:44,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {345#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} {341#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #38#return; {337#(< (mod |main_#t~ret4| 4294967296) 268435455)} is VALID [2022-04-27 10:31:44,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} assume true; {345#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:44,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {345#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:44,936 INFO L272 TraceCheckUtils]: 7: Hoare triple {341#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:44,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {341#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:44,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {341#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:44,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:44,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:44,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:44,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:44,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 10:31:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:44,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873244653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:44,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:44,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-27 10:31:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964214213] [2022-04-27 10:31:44,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:44,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-27 10:31:44,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:44,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:44,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:31:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:31:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:31:44,978 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:45,424 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:31:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:31:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-27 10:31:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-27 10:31:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-27 10:31:45,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-27 10:31:45,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:45,457 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:31:45,457 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 10:31:45,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:31:45,458 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:45,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:31:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 10:31:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 10:31:45,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:45,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:45,470 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:45,470 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:45,472 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 10:31:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 10:31:45,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:45,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:45,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 10:31:45,473 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 10:31:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:45,475 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 10:31:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 10:31:45,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:45,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:45,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:45,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 10:31:45,477 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-27 10:31:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:45,478 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 10:31:45,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 10:31:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:31:45,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:45,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:45,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:31:45,692 WARN L477 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-04-27 10:31:45,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash -371085120, now seen corresponding path program 2 times [2022-04-27 10:31:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:45,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489971830] [2022-04-27 10:31:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:45,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {518#true} is VALID [2022-04-27 10:31:45,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 10:31:45,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {518#true} {518#true} #42#return; {518#true} is VALID [2022-04-27 10:31:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:31:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:45,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {523#(= main_~x~0 0)} #38#return; {527#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:45,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:31:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:45,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {532#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 10:31:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:45,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {537#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:45,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:45,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {518#true} is VALID [2022-04-27 10:31:45,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 10:31:45,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #42#return; {518#true} is VALID [2022-04-27 10:31:45,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret5 := main(); {518#true} is VALID [2022-04-27 10:31:45,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := 0; {523#(= main_~x~0 0)} is VALID [2022-04-27 10:31:45,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {523#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {523#(= main_~x~0 0)} is VALID [2022-04-27 10:31:45,966 INFO L272 TraceCheckUtils]: 7: Hoare triple {523#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:45,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {523#(= main_~x~0 0)} #38#return; {527#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:45,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:45,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:45,969 INFO L272 TraceCheckUtils]: 13: Hoare triple {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:45,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,972 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {532#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:45,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {532#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:45,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:45,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:45,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:45,975 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {537#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:45,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {537#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {538#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:45,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {538#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {519#false} is VALID [2022-04-27 10:31:45,977 INFO L272 TraceCheckUtils]: 25: Hoare triple {519#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {519#false} is VALID [2022-04-27 10:31:45,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {519#false} ~cond := #in~cond; {519#false} is VALID [2022-04-27 10:31:45,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {519#false} assume 0 == ~cond; {519#false} is VALID [2022-04-27 10:31:45,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-27 10:31:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:31:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489971830] [2022-04-27 10:31:45,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489971830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958730818] [2022-04-27 10:31:45,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:45,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:45,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:45,980 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-04-27 10:31:45,981 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-04-27 10:31:46,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:46,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:46,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 10:31:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:46,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:46,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {518#true} is VALID [2022-04-27 10:31:46,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {518#true} is VALID [2022-04-27 10:31:46,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 10:31:46,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #42#return; {518#true} is VALID [2022-04-27 10:31:46,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret5 := main(); {518#true} is VALID [2022-04-27 10:31:46,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := 0; {523#(= main_~x~0 0)} is VALID [2022-04-27 10:31:46,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {523#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {523#(= main_~x~0 0)} is VALID [2022-04-27 10:31:46,564 INFO L272 TraceCheckUtils]: 7: Hoare triple {523#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {523#(= main_~x~0 0)} #38#return; {527#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:46,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:46,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:46,568 INFO L272 TraceCheckUtils]: 13: Hoare triple {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:46,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,570 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {532#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:46,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {532#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:46,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:46,572 INFO L272 TraceCheckUtils]: 19: Hoare triple {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:46,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:46,574 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {540#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {533#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {537#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:46,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {537#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {613#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:46,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {613#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {519#false} is VALID [2022-04-27 10:31:46,575 INFO L272 TraceCheckUtils]: 25: Hoare triple {519#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {519#false} is VALID [2022-04-27 10:31:46,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {519#false} ~cond := #in~cond; {519#false} is VALID [2022-04-27 10:31:46,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {519#false} assume 0 == ~cond; {519#false} is VALID [2022-04-27 10:31:46,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-27 10:31:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:31:46,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:47,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-27 10:31:47,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {519#false} assume 0 == ~cond; {519#false} is VALID [2022-04-27 10:31:47,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {519#false} ~cond := #in~cond; {519#false} is VALID [2022-04-27 10:31:47,109 INFO L272 TraceCheckUtils]: 25: Hoare triple {519#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {519#false} is VALID [2022-04-27 10:31:47,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {641#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {519#false} is VALID [2022-04-27 10:31:47,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {645#(< (mod |main_#t~ret4| 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {641#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,111 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {653#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} {649#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #38#return; {645#(< (mod |main_#t~ret4| 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {653#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} assume true; {653#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:47,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {653#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:47,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {649#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:47,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {649#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {649#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {666#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {649#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,115 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {674#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} {670#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} #38#return; {666#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} assume true; {674#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:31:47,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {674#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:31:47,117 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:47,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {670#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {670#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {695#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} {691#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} #38#return; {687#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {695#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} assume true; {695#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:47,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#true} ~z := #in~z;#res := 2 + ~z; {695#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:47,121 INFO L272 TraceCheckUtils]: 7: Hoare triple {691#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {518#true} is VALID [2022-04-27 10:31:47,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {691#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {691#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} ~x~0 := 0; {691#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:31:47,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret5 := main(); {518#true} is VALID [2022-04-27 10:31:47,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #42#return; {518#true} is VALID [2022-04-27 10:31:47,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 10:31:47,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {518#true} is VALID [2022-04-27 10:31:47,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {518#true} is VALID [2022-04-27 10:31:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:31:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958730818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:47,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:47,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2022-04-27 10:31:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475976328] [2022-04-27 10:31:47,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2022-04-27 10:31:47,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:47,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:31:47,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:47,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:31:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:31:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:31:47,175 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:31:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:48,429 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 10:31:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:31:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2022-04-27 10:31:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:31:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-27 10:31:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:31:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2022-04-27 10:31:48,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2022-04-27 10:31:48,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:48,496 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:31:48,496 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 10:31:48,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 10:31:48,498 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:48,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:31:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 10:31:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 10:31:48,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:48,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:31:48,516 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:31:48,517 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:31:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:48,522 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-27 10:31:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 10:31:48,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:48,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:48,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 36 states. [2022-04-27 10:31:48,524 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 36 states. [2022-04-27 10:31:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:48,526 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-27 10:31:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 10:31:48,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:48,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:48,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:48,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:31:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-27 10:31:48,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 29 [2022-04-27 10:31:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:48,529 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-27 10:31:48,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:31:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-27 10:31:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 10:31:48,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:48,531 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:48,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:31:48,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:31:48,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1581790520, now seen corresponding path program 3 times [2022-04-27 10:31:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:48,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864654253] [2022-04-27 10:31:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {948#true} is VALID [2022-04-27 10:31:49,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {948#true} assume true; {948#true} is VALID [2022-04-27 10:31:49,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {948#true} {948#true} #42#return; {948#true} is VALID [2022-04-27 10:31:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:31:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {953#(= main_~x~0 0)} #38#return; {957#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:31:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {962#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 10:31:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {967#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:31:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {972#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:31:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:31:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {977#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:31:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:31:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {982#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:31:49,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:31:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {987#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:31:49,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {948#true} call ULTIMATE.init(); {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:49,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {948#true} is VALID [2022-04-27 10:31:49,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {948#true} assume true; {948#true} is VALID [2022-04-27 10:31:49,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {948#true} {948#true} #42#return; {948#true} is VALID [2022-04-27 10:31:49,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {948#true} call #t~ret5 := main(); {948#true} is VALID [2022-04-27 10:31:49,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {948#true} ~x~0 := 0; {953#(= main_~x~0 0)} is VALID [2022-04-27 10:31:49,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {953#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {953#(= main_~x~0 0)} is VALID [2022-04-27 10:31:49,255 INFO L272 TraceCheckUtils]: 7: Hoare triple {953#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {953#(= main_~x~0 0)} #38#return; {957#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:49,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:49,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:49,258 INFO L272 TraceCheckUtils]: 13: Hoare triple {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,260 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {962#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:49,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {962#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:49,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:49,261 INFO L272 TraceCheckUtils]: 19: Hoare triple {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,263 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {967#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:49,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:49,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:49,264 INFO L272 TraceCheckUtils]: 25: Hoare triple {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,266 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {972#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:31:49,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {972#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:49,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:49,272 INFO L272 TraceCheckUtils]: 31: Hoare triple {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,276 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {977#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:31:49,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {977#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:49,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:49,281 INFO L272 TraceCheckUtils]: 37: Hoare triple {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,283 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {982#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:31:49,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {982#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:49,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:49,286 INFO L272 TraceCheckUtils]: 43: Hoare triple {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:49,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:49,293 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {987#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:31:49,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {987#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {988#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:49,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {988#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {949#false} is VALID [2022-04-27 10:31:49,297 INFO L272 TraceCheckUtils]: 49: Hoare triple {949#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {949#false} is VALID [2022-04-27 10:31:49,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {949#false} ~cond := #in~cond; {949#false} is VALID [2022-04-27 10:31:49,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {949#false} assume 0 == ~cond; {949#false} is VALID [2022-04-27 10:31:49,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {949#false} assume !false; {949#false} is VALID [2022-04-27 10:31:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-27 10:31:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864654253] [2022-04-27 10:31:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864654253] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189032298] [2022-04-27 10:31:49,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:49,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:49,304 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-04-27 10:31:49,305 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-04-27 10:31:49,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-27 10:31:49,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:49,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-27 10:31:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:49,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:50,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {948#true} call ULTIMATE.init(); {948#true} is VALID [2022-04-27 10:31:50,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {948#true} is VALID [2022-04-27 10:31:50,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {948#true} assume true; {948#true} is VALID [2022-04-27 10:31:50,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {948#true} {948#true} #42#return; {948#true} is VALID [2022-04-27 10:31:50,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {948#true} call #t~ret5 := main(); {948#true} is VALID [2022-04-27 10:31:50,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {948#true} ~x~0 := 0; {953#(= main_~x~0 0)} is VALID [2022-04-27 10:31:50,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {953#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {953#(= main_~x~0 0)} is VALID [2022-04-27 10:31:50,195 INFO L272 TraceCheckUtils]: 7: Hoare triple {953#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {953#(= main_~x~0 0)} #38#return; {957#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:50,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:50,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:50,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {962#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:31:50,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {962#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:50,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:50,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,203 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {963#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {967#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:31:50,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:50,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:50,204 INFO L272 TraceCheckUtils]: 25: Hoare triple {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,205 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {968#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {972#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:31:50,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {972#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:50,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:50,206 INFO L272 TraceCheckUtils]: 31: Hoare triple {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,208 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {973#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {977#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:31:50,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {977#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:50,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:50,209 INFO L272 TraceCheckUtils]: 37: Hoare triple {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,210 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {978#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {982#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:31:50,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {982#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:50,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:50,211 INFO L272 TraceCheckUtils]: 43: Hoare triple {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:50,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:50,214 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {990#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {983#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {987#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:31:50,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {987#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1135#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:50,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {1135#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 268435455); {949#false} is VALID [2022-04-27 10:31:50,215 INFO L272 TraceCheckUtils]: 49: Hoare triple {949#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {949#false} is VALID [2022-04-27 10:31:50,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {949#false} ~cond := #in~cond; {949#false} is VALID [2022-04-27 10:31:50,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {949#false} assume 0 == ~cond; {949#false} is VALID [2022-04-27 10:31:50,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {949#false} assume !false; {949#false} is VALID [2022-04-27 10:31:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-27 10:31:50,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:51,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {949#false} assume !false; {949#false} is VALID [2022-04-27 10:31:51,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {949#false} assume 0 == ~cond; {949#false} is VALID [2022-04-27 10:31:51,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {949#false} ~cond := #in~cond; {949#false} is VALID [2022-04-27 10:31:51,451 INFO L272 TraceCheckUtils]: 49: Hoare triple {949#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {949#false} is VALID [2022-04-27 10:31:51,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {1163#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {949#false} is VALID [2022-04-27 10:31:51,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {1167#(< (mod |main_#t~ret4| 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1163#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,452 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1175#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} {1171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #38#return; {1167#(< (mod |main_#t~ret4| 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {1175#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} assume true; {1175#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1175#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,453 INFO L272 TraceCheckUtils]: 43: Hoare triple {1171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {1171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {1188#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,455 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1196#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} {1192#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} #38#return; {1188#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {1196#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} assume true; {1196#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:31:51,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1196#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:31:51,456 INFO L272 TraceCheckUtils]: 37: Hoare triple {1192#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {1192#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1192#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {1209#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1192#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,460 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1217#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} {1213#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} #38#return; {1209#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {1217#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} assume true; {1217#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1217#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,462 INFO L272 TraceCheckUtils]: 31: Hoare triple {1213#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {1213#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1213#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {1230#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1213#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,463 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1238#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} {1234#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} #38#return; {1230#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {1238#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} assume true; {1238#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1238#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,464 INFO L272 TraceCheckUtils]: 25: Hoare triple {1234#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {1234#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1234#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {1251#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1234#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,466 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1259#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} {1255#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} #38#return; {1251#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {1259#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} assume true; {1259#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1259#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,469 INFO L272 TraceCheckUtils]: 19: Hoare triple {1255#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1255#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1255#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1280#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} {1276#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} #38#return; {1272#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} assume true; {1280#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1280#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {1276#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1276#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {1276#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1301#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} {1297#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} #38#return; {1293#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {1301#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} assume true; {1301#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#true} ~z := #in~z;#res := 2 + ~z; {1301#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:31:51,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {1297#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {948#true} is VALID [2022-04-27 10:31:51,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {1297#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {948#true} ~x~0 := 0; {1297#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:31:51,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {948#true} call #t~ret5 := main(); {948#true} is VALID [2022-04-27 10:31:51,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {948#true} {948#true} #42#return; {948#true} is VALID [2022-04-27 10:31:51,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {948#true} assume true; {948#true} is VALID [2022-04-27 10:31:51,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {948#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {948#true} is VALID [2022-04-27 10:31:51,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {948#true} call ULTIMATE.init(); {948#true} is VALID [2022-04-27 10:31:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 10:31:51,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189032298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:51,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:51,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 42 [2022-04-27 10:31:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244105556] [2022-04-27 10:31:51,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 53 [2022-04-27 10:31:51,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:51,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:31:51,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:51,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 10:31:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 10:31:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 10:31:51,553 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:31:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:59,171 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-27 10:31:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 10:31:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 53 [2022-04-27 10:31:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:31:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 86 transitions. [2022-04-27 10:31:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:31:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 86 transitions. [2022-04-27 10:31:59,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 86 transitions. [2022-04-27 10:31:59,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:59,284 INFO L225 Difference]: With dead ends: 65 [2022-04-27 10:31:59,285 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:31:59,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=845, Invalid=4267, Unknown=0, NotChecked=0, Total=5112 [2022-04-27 10:31:59,287 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:59,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 143 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 10:31:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:31:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 10:31:59,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:59,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 10:31:59,326 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 10:31:59,327 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 10:31:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:59,331 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 10:31:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 10:31:59,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:59,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:59,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-04-27 10:31:59,333 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-04-27 10:31:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:59,336 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 10:31:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 10:31:59,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:59,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:59,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:59,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 18 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 10:31:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-27 10:31:59,341 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 53 [2022-04-27 10:31:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:59,341 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-27 10:31:59,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 27 states have internal predecessors, (56), 16 states have call successors, (18), 3 states have call predecessors, (18), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 10:31:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 10:31:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 10:31:59,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:59,344 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:59,366 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-04-27 10:31:59,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:59,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -346716632, now seen corresponding path program 4 times [2022-04-27 10:31:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:59,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071402242] [2022-04-27 10:31:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:32:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {1795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-27 10:32:00,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-27 10:32:00,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1714#true} {1714#true} #42#return; {1714#true} is VALID [2022-04-27 10:32:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:32:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1719#(= main_~x~0 0)} #38#return; {1723#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:32:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:32:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {1728#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:32:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 10:32:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {1733#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:32:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:32:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {1738#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:32:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {1743#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:32:00,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:32:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {1748#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:32:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:32:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {1753#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:32:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {1758#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:32:00,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:32:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {1763#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:32:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-27 10:32:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {1768#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-27 10:32:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {1773#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:32:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {1778#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-27 10:32:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {1783#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:32:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-27 10:32:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {1788#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-27 10:32:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {1793#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:32:00,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {1714#true} call ULTIMATE.init(); {1795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:32:00,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {1795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-27 10:32:00,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-27 10:32:00,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1714#true} {1714#true} #42#return; {1714#true} is VALID [2022-04-27 10:32:00,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {1714#true} call #t~ret5 := main(); {1714#true} is VALID [2022-04-27 10:32:00,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1714#true} ~x~0 := 0; {1719#(= main_~x~0 0)} is VALID [2022-04-27 10:32:00,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1719#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1719#(= main_~x~0 0)} is VALID [2022-04-27 10:32:00,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {1719#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1719#(= main_~x~0 0)} #38#return; {1723#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:32:00,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {1723#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:00,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:00,626 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {1728#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:32:00,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:00,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:00,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,630 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {1733#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:32:00,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {1733#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:00,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:00,631 INFO L272 TraceCheckUtils]: 25: Hoare triple {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,633 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {1738#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {1738#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:00,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:00,634 INFO L272 TraceCheckUtils]: 31: Hoare triple {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,635 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {1743#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:32:00,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {1743#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:00,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:00,636 INFO L272 TraceCheckUtils]: 37: Hoare triple {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,638 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {1748#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:32:00,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {1748#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:00,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:00,639 INFO L272 TraceCheckUtils]: 43: Hoare triple {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,641 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {1753#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {1753#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:00,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:00,641 INFO L272 TraceCheckUtils]: 49: Hoare triple {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,643 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {1758#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:32:00,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {1758#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} ~x~0 := #t~ret4;havoc #t~ret4; {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:00,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:00,644 INFO L272 TraceCheckUtils]: 55: Hoare triple {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,646 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {1763#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:32:00,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {1763#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} ~x~0 := #t~ret4;havoc #t~ret4; {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:00,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:00,646 INFO L272 TraceCheckUtils]: 61: Hoare triple {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,648 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {1768#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {1768#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:00,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:00,649 INFO L272 TraceCheckUtils]: 67: Hoare triple {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,649 INFO L290 TraceCheckUtils]: 68: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,650 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {1773#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {1773#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:00,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:00,651 INFO L272 TraceCheckUtils]: 73: Hoare triple {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,652 INFO L290 TraceCheckUtils]: 74: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,653 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {1778#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {1778#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:00,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:00,654 INFO L272 TraceCheckUtils]: 79: Hoare triple {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,655 INFO L290 TraceCheckUtils]: 81: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,655 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {1783#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:32:00,656 INFO L290 TraceCheckUtils]: 83: Hoare triple {1783#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} ~x~0 := #t~ret4;havoc #t~ret4; {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:00,656 INFO L290 TraceCheckUtils]: 84: Hoare triple {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:00,656 INFO L272 TraceCheckUtils]: 85: Hoare triple {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,657 INFO L290 TraceCheckUtils]: 86: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,657 INFO L290 TraceCheckUtils]: 87: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,658 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {1788#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:32:00,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {1788#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:00,659 INFO L290 TraceCheckUtils]: 90: Hoare triple {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:00,659 INFO L272 TraceCheckUtils]: 91: Hoare triple {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:00,659 INFO L290 TraceCheckUtils]: 92: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:00,661 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {1793#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:32:00,661 INFO L290 TraceCheckUtils]: 95: Hoare triple {1793#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} ~x~0 := #t~ret4;havoc #t~ret4; {1794#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:32:00,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {1794#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1715#false} is VALID [2022-04-27 10:32:00,662 INFO L272 TraceCheckUtils]: 97: Hoare triple {1715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1715#false} is VALID [2022-04-27 10:32:00,662 INFO L290 TraceCheckUtils]: 98: Hoare triple {1715#false} ~cond := #in~cond; {1715#false} is VALID [2022-04-27 10:32:00,662 INFO L290 TraceCheckUtils]: 99: Hoare triple {1715#false} assume 0 == ~cond; {1715#false} is VALID [2022-04-27 10:32:00,662 INFO L290 TraceCheckUtils]: 100: Hoare triple {1715#false} assume !false; {1715#false} is VALID [2022-04-27 10:32:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-27 10:32:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:32:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071402242] [2022-04-27 10:32:00,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071402242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:32:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404425436] [2022-04-27 10:32:00,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:32:00,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:32:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:32:00,665 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-04-27 10:32:00,671 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-04-27 10:32:00,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:32:00,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:32:00,742 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 153 conjunts are in the unsatisfiable core [2022-04-27 10:32:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:00,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:32:02,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {1714#true} call ULTIMATE.init(); {1714#true} is VALID [2022-04-27 10:32:02,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1714#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-27 10:32:02,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-27 10:32:02,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1714#true} {1714#true} #42#return; {1714#true} is VALID [2022-04-27 10:32:02,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1714#true} call #t~ret5 := main(); {1714#true} is VALID [2022-04-27 10:32:02,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1714#true} ~x~0 := 0; {1719#(= main_~x~0 0)} is VALID [2022-04-27 10:32:02,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1719#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1719#(= main_~x~0 0)} is VALID [2022-04-27 10:32:02,246 INFO L272 TraceCheckUtils]: 7: Hoare triple {1719#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,247 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1719#(= main_~x~0 0)} #38#return; {1723#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:32:02,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {1723#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:02,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:02,248 INFO L272 TraceCheckUtils]: 13: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,249 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {1728#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:32:02,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:02,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:02,250 INFO L272 TraceCheckUtils]: 19: Hoare triple {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,252 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1729#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {1733#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:32:02,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {1733#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:02,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:02,253 INFO L272 TraceCheckUtils]: 25: Hoare triple {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,255 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1734#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {1738#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {1738#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:02,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:02,255 INFO L272 TraceCheckUtils]: 31: Hoare triple {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,257 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1739#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {1743#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:32:02,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {1743#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:02,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:02,257 INFO L272 TraceCheckUtils]: 37: Hoare triple {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,259 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1744#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {1748#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:32:02,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {1748#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:02,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:02,260 INFO L272 TraceCheckUtils]: 43: Hoare triple {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,261 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1749#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {1753#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {1753#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:02,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:02,262 INFO L272 TraceCheckUtils]: 49: Hoare triple {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,264 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1754#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {1758#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:32:02,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {1758#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} ~x~0 := #t~ret4;havoc #t~ret4; {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:02,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:02,265 INFO L272 TraceCheckUtils]: 55: Hoare triple {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,266 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1759#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {1763#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:32:02,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {1763#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} ~x~0 := #t~ret4;havoc #t~ret4; {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:02,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:02,267 INFO L272 TraceCheckUtils]: 61: Hoare triple {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,268 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1764#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {1768#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {1768#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:02,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:02,271 INFO L272 TraceCheckUtils]: 67: Hoare triple {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,273 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1769#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {1773#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {1773#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:02,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:02,273 INFO L272 TraceCheckUtils]: 73: Hoare triple {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,274 INFO L290 TraceCheckUtils]: 75: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,275 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1774#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {1778#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,275 INFO L290 TraceCheckUtils]: 77: Hoare triple {1778#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:02,275 INFO L290 TraceCheckUtils]: 78: Hoare triple {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:02,275 INFO L272 TraceCheckUtils]: 79: Hoare triple {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,277 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1779#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {1783#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:32:02,277 INFO L290 TraceCheckUtils]: 83: Hoare triple {1783#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} ~x~0 := #t~ret4;havoc #t~ret4; {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:02,277 INFO L290 TraceCheckUtils]: 84: Hoare triple {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:02,278 INFO L272 TraceCheckUtils]: 85: Hoare triple {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,279 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1784#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {1788#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:32:02,279 INFO L290 TraceCheckUtils]: 89: Hoare triple {1788#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:02,280 INFO L290 TraceCheckUtils]: 90: Hoare triple {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:02,280 INFO L272 TraceCheckUtils]: 91: Hoare triple {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:02,280 INFO L290 TraceCheckUtils]: 92: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,280 INFO L290 TraceCheckUtils]: 93: Hoare triple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:32:02,281 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {1796#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1789#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {1793#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:32:02,281 INFO L290 TraceCheckUtils]: 95: Hoare triple {1793#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} ~x~0 := #t~ret4;havoc #t~ret4; {2085#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:32:02,282 INFO L290 TraceCheckUtils]: 96: Hoare triple {2085#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {1715#false} is VALID [2022-04-27 10:32:02,282 INFO L272 TraceCheckUtils]: 97: Hoare triple {1715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1715#false} is VALID [2022-04-27 10:32:02,282 INFO L290 TraceCheckUtils]: 98: Hoare triple {1715#false} ~cond := #in~cond; {1715#false} is VALID [2022-04-27 10:32:02,282 INFO L290 TraceCheckUtils]: 99: Hoare triple {1715#false} assume 0 == ~cond; {1715#false} is VALID [2022-04-27 10:32:02,282 INFO L290 TraceCheckUtils]: 100: Hoare triple {1715#false} assume !false; {1715#false} is VALID [2022-04-27 10:32:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-27 10:32:02,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:32:05,545 INFO L290 TraceCheckUtils]: 100: Hoare triple {1715#false} assume !false; {1715#false} is VALID [2022-04-27 10:32:05,546 INFO L290 TraceCheckUtils]: 99: Hoare triple {1715#false} assume 0 == ~cond; {1715#false} is VALID [2022-04-27 10:32:05,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {1715#false} ~cond := #in~cond; {1715#false} is VALID [2022-04-27 10:32:05,546 INFO L272 TraceCheckUtils]: 97: Hoare triple {1715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1715#false} is VALID [2022-04-27 10:32:05,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {2113#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1715#false} is VALID [2022-04-27 10:32:05,546 INFO L290 TraceCheckUtils]: 95: Hoare triple {2117#(< (mod |main_#t~ret4| 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2113#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,547 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {2125#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} {2121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #38#return; {2117#(< (mod |main_#t~ret4| 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {2125#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} assume true; {2125#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,548 INFO L290 TraceCheckUtils]: 92: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2125#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,548 INFO L272 TraceCheckUtils]: 91: Hoare triple {2121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {2121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,549 INFO L290 TraceCheckUtils]: 89: Hoare triple {2138#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,549 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {2146#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} {2142#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} #38#return; {2138#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,550 INFO L290 TraceCheckUtils]: 87: Hoare triple {2146#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} assume true; {2146#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,550 INFO L290 TraceCheckUtils]: 86: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2146#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,550 INFO L272 TraceCheckUtils]: 85: Hoare triple {2142#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {2142#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2142#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {2159#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2142#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,553 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {2167#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} {2163#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} #38#return; {2159#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {2167#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} assume true; {2167#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2167#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,554 INFO L272 TraceCheckUtils]: 79: Hoare triple {2163#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {2163#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2163#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,555 INFO L290 TraceCheckUtils]: 77: Hoare triple {2180#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2163#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,556 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {2188#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} {2184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} #38#return; {2180#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {2188#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} assume true; {2188#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2188#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,557 INFO L272 TraceCheckUtils]: 73: Hoare triple {2184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {2184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {2201#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,559 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2209#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} {2205#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} #38#return; {2201#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {2209#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} assume true; {2209#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2209#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,560 INFO L272 TraceCheckUtils]: 67: Hoare triple {2205#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {2205#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2205#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {2222#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2205#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,561 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2230#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} {2226#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} #38#return; {2222#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {2230#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} assume true; {2230#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2230#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,562 INFO L272 TraceCheckUtils]: 61: Hoare triple {2226#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {2226#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2226#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {2243#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2226#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,566 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2251#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} {2247#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} #38#return; {2243#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {2251#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} assume true; {2251#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2251#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,567 INFO L272 TraceCheckUtils]: 55: Hoare triple {2247#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {2247#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2247#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {2264#(< (mod (+ 14 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2247#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,568 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2272#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} {2268#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} #38#return; {2264#(< (mod (+ 14 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {2272#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} assume true; {2272#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2272#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,569 INFO L272 TraceCheckUtils]: 49: Hoare triple {2268#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {2268#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2268#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {2285#(< (mod (+ 16 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2268#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,571 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2293#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} {2289#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} #38#return; {2285#(< (mod (+ 16 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {2293#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} assume true; {2293#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2293#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,572 INFO L272 TraceCheckUtils]: 43: Hoare triple {2289#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {2289#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2289#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {2306#(< (mod (+ |main_#t~ret4| 18) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2289#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,573 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2314#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} {2310#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} #38#return; {2306#(< (mod (+ |main_#t~ret4| 18) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {2314#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} assume true; {2314#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2314#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,574 INFO L272 TraceCheckUtils]: 37: Hoare triple {2310#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {2310#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2310#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {2327#(< (mod (+ |main_#t~ret4| 20) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2310#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,575 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2335#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} {2331#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} #38#return; {2327#(< (mod (+ |main_#t~ret4| 20) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} assume true; {2335#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2335#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,576 INFO L272 TraceCheckUtils]: 31: Hoare triple {2331#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {2331#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2331#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {2348#(< (mod (+ 22 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2331#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,580 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2356#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} {2352#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} #38#return; {2348#(< (mod (+ 22 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {2356#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} assume true; {2356#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2356#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,581 INFO L272 TraceCheckUtils]: 25: Hoare triple {2352#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {2352#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2352#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {2369#(< (mod (+ |main_#t~ret4| 24) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2352#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,582 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2377#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} {2373#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} #38#return; {2369#(< (mod (+ |main_#t~ret4| 24) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {2377#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} assume true; {2377#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2377#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,584 INFO L272 TraceCheckUtils]: 19: Hoare triple {2373#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2373#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2373#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {2390#(< (mod (+ |main_#t~ret4| 26) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2373#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,585 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2398#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} {2394#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} #38#return; {2390#(< (mod (+ |main_#t~ret4| 26) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {2398#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} assume true; {2398#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2398#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} is VALID [2022-04-27 10:32:05,593 INFO L272 TraceCheckUtils]: 13: Hoare triple {2394#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {2394#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2394#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {2411#(< (mod (+ |main_#t~ret4| 28) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {2394#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2419#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} {2415#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} #38#return; {2411#(< (mod (+ |main_#t~ret4| 28) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2419#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} assume true; {2419#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {1714#true} ~z := #in~z;#res := 2 + ~z; {2419#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} is VALID [2022-04-27 10:32:05,596 INFO L272 TraceCheckUtils]: 7: Hoare triple {2415#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {1714#true} is VALID [2022-04-27 10:32:05,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {2415#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2415#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1714#true} ~x~0 := 0; {2415#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:32:05,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {1714#true} call #t~ret5 := main(); {1714#true} is VALID [2022-04-27 10:32:05,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1714#true} {1714#true} #42#return; {1714#true} is VALID [2022-04-27 10:32:05,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1714#true} assume true; {1714#true} is VALID [2022-04-27 10:32:05,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1714#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1714#true} is VALID [2022-04-27 10:32:05,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1714#true} call ULTIMATE.init(); {1714#true} is VALID [2022-04-27 10:32:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-27 10:32:05,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404425436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:32:05,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:32:05,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 48] total 82 [2022-04-27 10:32:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292172907] [2022-04-27 10:32:05,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:32:05,601 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 101 [2022-04-27 10:32:05,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:32:05,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 10:32:05,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:32:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-27 10:32:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:32:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-27 10:32:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5953, Unknown=0, NotChecked=0, Total=6642 [2022-04-27 10:32:05,723 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 10:34:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:34:42,783 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-04-27 10:34:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-27 10:34:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Word has length 101 [2022-04-27 10:34:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:34:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 10:34:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 158 transitions. [2022-04-27 10:34:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 10:34:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 158 transitions. [2022-04-27 10:34:42,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 158 transitions. [2022-04-27 10:34:43,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:34:43,076 INFO L225 Difference]: With dead ends: 113 [2022-04-27 10:34:43,076 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 10:34:43,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 150.2s TimeCoverageRelationStatistics Valid=3101, Invalid=17490, Unknown=1, NotChecked=0, Total=20592 [2022-04-27 10:34:43,084 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 72 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 4094 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 4355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:34:43,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 291 Invalid, 4355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4094 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-27 10:34:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 10:34:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-27 10:34:43,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:34:43,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 10:34:43,206 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 10:34:43,210 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 10:34:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:34:43,218 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-04-27 10:34:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-04-27 10:34:43,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:34:43,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:34:43,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 108 states. [2022-04-27 10:34:43,219 INFO L87 Difference]: Start difference. First operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 108 states. [2022-04-27 10:34:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:34:43,226 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-04-27 10:34:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-04-27 10:34:43,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:34:43,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:34:43,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:34:43,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:34:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 34 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 10:34:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2022-04-27 10:34:43,235 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 101 [2022-04-27 10:34:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:34:43,235 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2022-04-27 10:34:43,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 51 states have internal predecessors, (104), 32 states have call successors, (34), 3 states have call predecessors, (34), 17 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 10:34:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-04-27 10:34:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-27 10:34:43,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:34:43,240 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:34:43,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:34:43,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:34:43,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:34:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:34:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash 143738888, now seen corresponding path program 5 times [2022-04-27 10:34:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:34:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897766496] [2022-04-27 10:34:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:34:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:34:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:34:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {3313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3152#true} is VALID [2022-04-27 10:34:45,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-04-27 10:34:45,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3152#true} {3152#true} #42#return; {3152#true} is VALID [2022-04-27 10:34:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:34:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3157#(= main_~x~0 0)} #38#return; {3161#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:34:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 10:34:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {3166#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:34:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 10:34:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {3171#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:34:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:34:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {3176#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-04-27 10:34:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {3181#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:34:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 10:34:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {3186#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:34:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-27 10:34:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {3191#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:34:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {3196#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:34:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 10:34:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {3201#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:34:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-04-27 10:34:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {3206#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-27 10:34:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {3211#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-27 10:34:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {3216#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-04-27 10:34:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {3221#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:34:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-27 10:34:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {3226#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-04-27 10:34:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {3231#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:34:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-04-27 10:34:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} #38#return; {3236#(and (<= |main_#t~ret4| 32) (<= 32 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-04-27 10:34:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} #38#return; {3241#(and (<= 34 |main_#t~ret4|) (<= |main_#t~ret4| 34))} is VALID [2022-04-27 10:34:45,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-27 10:34:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} #38#return; {3246#(and (<= 36 |main_#t~ret4|) (<= |main_#t~ret4| 36))} is VALID [2022-04-27 10:34:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-04-27 10:34:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} #38#return; {3251#(and (<= 38 |main_#t~ret4|) (<= |main_#t~ret4| 38))} is VALID [2022-04-27 10:34:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-04-27 10:34:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} #38#return; {3256#(and (<= 40 |main_#t~ret4|) (<= |main_#t~ret4| 40))} is VALID [2022-04-27 10:34:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-04-27 10:34:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} #38#return; {3261#(and (<= |main_#t~ret4| 42) (<= 42 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-04-27 10:34:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} #38#return; {3266#(and (<= 44 |main_#t~ret4|) (<= |main_#t~ret4| 44))} is VALID [2022-04-27 10:34:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-27 10:34:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} #38#return; {3271#(and (<= 46 |main_#t~ret4|) (<= |main_#t~ret4| 46))} is VALID [2022-04-27 10:34:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-04-27 10:34:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} #38#return; {3276#(and (<= |main_#t~ret4| 48) (<= 48 |main_#t~ret4|))} is VALID [2022-04-27 10:34:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-04-27 10:34:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} #38#return; {3281#(and (<= 50 |main_#t~ret4|) (<= |main_#t~ret4| 50))} is VALID [2022-04-27 10:34:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-27 10:34:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:45,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:45,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} #38#return; {3286#(and (<= 52 |main_#t~ret4|) (<= |main_#t~ret4| 52))} is VALID [2022-04-27 10:34:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-04-27 10:34:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:46,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} #38#return; {3291#(and (<= 54 |main_#t~ret4|) (<= |main_#t~ret4| 54))} is VALID [2022-04-27 10:34:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-04-27 10:34:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:46,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} #38#return; {3296#(and (<= 56 |main_#t~ret4|) (<= |main_#t~ret4| 56))} is VALID [2022-04-27 10:34:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-04-27 10:34:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:46,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} #38#return; {3301#(and (<= |main_#t~ret4| 58) (<= 58 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-04-27 10:34:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:46,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} #38#return; {3306#(and (<= 60 |main_#t~ret4|) (<= |main_#t~ret4| 60))} is VALID [2022-04-27 10:34:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-04-27 10:34:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:34:46,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} #38#return; {3311#(and (<= |main_#t~ret4| 62) (<= 62 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:34:46,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {3313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3152#true} is VALID [2022-04-27 10:34:46,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-04-27 10:34:46,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #42#return; {3152#true} is VALID [2022-04-27 10:34:46,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret5 := main(); {3152#true} is VALID [2022-04-27 10:34:46,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {3152#true} ~x~0 := 0; {3157#(= main_~x~0 0)} is VALID [2022-04-27 10:34:46,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {3157#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3157#(= main_~x~0 0)} is VALID [2022-04-27 10:34:46,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {3157#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3157#(= main_~x~0 0)} #38#return; {3161#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:34:46,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {3161#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:34:46,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:34:46,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,052 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {3166#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:34:46,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {3166#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:34:46,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:34:46,053 INFO L272 TraceCheckUtils]: 19: Hoare triple {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,054 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {3171#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:34:46,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {3171#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:34:46,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:34:46,055 INFO L272 TraceCheckUtils]: 25: Hoare triple {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,056 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {3176#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:34:46,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:34:46,057 INFO L272 TraceCheckUtils]: 31: Hoare triple {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,059 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {3181#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:34:46,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {3181#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:34:46,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:34:46,060 INFO L272 TraceCheckUtils]: 37: Hoare triple {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,061 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {3186#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:34:46,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:34:46,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:34:46,062 INFO L272 TraceCheckUtils]: 43: Hoare triple {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,063 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {3191#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {3191#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:34:46,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:34:46,064 INFO L272 TraceCheckUtils]: 49: Hoare triple {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,066 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {3196#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:34:46,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {3196#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} ~x~0 := #t~ret4;havoc #t~ret4; {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:34:46,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:34:46,067 INFO L272 TraceCheckUtils]: 55: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,068 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {3201#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:34:46,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {3201#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} ~x~0 := #t~ret4;havoc #t~ret4; {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:34:46,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:34:46,069 INFO L272 TraceCheckUtils]: 61: Hoare triple {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,070 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {3206#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {3206#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:34:46,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:34:46,071 INFO L272 TraceCheckUtils]: 67: Hoare triple {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,073 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {3211#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {3211#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:34:46,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:34:46,074 INFO L272 TraceCheckUtils]: 73: Hoare triple {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,074 INFO L290 TraceCheckUtils]: 75: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,075 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {3216#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {3216#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:34:46,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:34:46,076 INFO L272 TraceCheckUtils]: 79: Hoare triple {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,077 INFO L290 TraceCheckUtils]: 81: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,077 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {3221#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:34:46,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {3221#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} ~x~0 := #t~ret4;havoc #t~ret4; {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:34:46,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:34:46,078 INFO L272 TraceCheckUtils]: 85: Hoare triple {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,080 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {3226#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {3226#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:34:46,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:34:46,081 INFO L272 TraceCheckUtils]: 91: Hoare triple {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,081 INFO L290 TraceCheckUtils]: 92: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,081 INFO L290 TraceCheckUtils]: 93: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,082 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {3231#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:34:46,083 INFO L290 TraceCheckUtils]: 95: Hoare triple {3231#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} ~x~0 := #t~ret4;havoc #t~ret4; {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:34:46,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:34:46,083 INFO L272 TraceCheckUtils]: 97: Hoare triple {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,083 INFO L290 TraceCheckUtils]: 98: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,084 INFO L290 TraceCheckUtils]: 99: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,084 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} #38#return; {3236#(and (<= |main_#t~ret4| 32) (<= 32 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {3236#(and (<= |main_#t~ret4| 32) (<= 32 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:34:46,085 INFO L290 TraceCheckUtils]: 102: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:34:46,085 INFO L272 TraceCheckUtils]: 103: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,086 INFO L290 TraceCheckUtils]: 104: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,086 INFO L290 TraceCheckUtils]: 105: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,087 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} #38#return; {3241#(and (<= 34 |main_#t~ret4|) (<= |main_#t~ret4| 34))} is VALID [2022-04-27 10:34:46,087 INFO L290 TraceCheckUtils]: 107: Hoare triple {3241#(and (<= 34 |main_#t~ret4|) (<= |main_#t~ret4| 34))} ~x~0 := #t~ret4;havoc #t~ret4; {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:34:46,088 INFO L290 TraceCheckUtils]: 108: Hoare triple {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:34:46,088 INFO L272 TraceCheckUtils]: 109: Hoare triple {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,088 INFO L290 TraceCheckUtils]: 110: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,088 INFO L290 TraceCheckUtils]: 111: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,089 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} #38#return; {3246#(and (<= 36 |main_#t~ret4|) (<= |main_#t~ret4| 36))} is VALID [2022-04-27 10:34:46,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {3246#(and (<= 36 |main_#t~ret4|) (<= |main_#t~ret4| 36))} ~x~0 := #t~ret4;havoc #t~ret4; {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:34:46,090 INFO L290 TraceCheckUtils]: 114: Hoare triple {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:34:46,090 INFO L272 TraceCheckUtils]: 115: Hoare triple {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,090 INFO L290 TraceCheckUtils]: 116: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,092 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} #38#return; {3251#(and (<= 38 |main_#t~ret4|) (<= |main_#t~ret4| 38))} is VALID [2022-04-27 10:34:46,092 INFO L290 TraceCheckUtils]: 119: Hoare triple {3251#(and (<= 38 |main_#t~ret4|) (<= |main_#t~ret4| 38))} ~x~0 := #t~ret4;havoc #t~ret4; {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:34:46,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:34:46,092 INFO L272 TraceCheckUtils]: 121: Hoare triple {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,093 INFO L290 TraceCheckUtils]: 122: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,093 INFO L290 TraceCheckUtils]: 123: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,094 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} #38#return; {3256#(and (<= 40 |main_#t~ret4|) (<= |main_#t~ret4| 40))} is VALID [2022-04-27 10:34:46,094 INFO L290 TraceCheckUtils]: 125: Hoare triple {3256#(and (<= 40 |main_#t~ret4|) (<= |main_#t~ret4| 40))} ~x~0 := #t~ret4;havoc #t~ret4; {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:34:46,095 INFO L290 TraceCheckUtils]: 126: Hoare triple {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:34:46,095 INFO L272 TraceCheckUtils]: 127: Hoare triple {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,095 INFO L290 TraceCheckUtils]: 128: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,096 INFO L290 TraceCheckUtils]: 129: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,096 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} #38#return; {3261#(and (<= |main_#t~ret4| 42) (<= 42 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,097 INFO L290 TraceCheckUtils]: 131: Hoare triple {3261#(and (<= |main_#t~ret4| 42) (<= 42 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:34:46,097 INFO L290 TraceCheckUtils]: 132: Hoare triple {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:34:46,097 INFO L272 TraceCheckUtils]: 133: Hoare triple {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,097 INFO L290 TraceCheckUtils]: 134: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,098 INFO L290 TraceCheckUtils]: 135: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,099 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} #38#return; {3266#(and (<= 44 |main_#t~ret4|) (<= |main_#t~ret4| 44))} is VALID [2022-04-27 10:34:46,099 INFO L290 TraceCheckUtils]: 137: Hoare triple {3266#(and (<= 44 |main_#t~ret4|) (<= |main_#t~ret4| 44))} ~x~0 := #t~ret4;havoc #t~ret4; {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:34:46,099 INFO L290 TraceCheckUtils]: 138: Hoare triple {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455); {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:34:46,100 INFO L272 TraceCheckUtils]: 139: Hoare triple {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,100 INFO L290 TraceCheckUtils]: 140: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,100 INFO L290 TraceCheckUtils]: 141: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,101 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} #38#return; {3271#(and (<= 46 |main_#t~ret4|) (<= |main_#t~ret4| 46))} is VALID [2022-04-27 10:34:46,101 INFO L290 TraceCheckUtils]: 143: Hoare triple {3271#(and (<= 46 |main_#t~ret4|) (<= |main_#t~ret4| 46))} ~x~0 := #t~ret4;havoc #t~ret4; {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:34:46,102 INFO L290 TraceCheckUtils]: 144: Hoare triple {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455); {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:34:46,102 INFO L272 TraceCheckUtils]: 145: Hoare triple {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,102 INFO L290 TraceCheckUtils]: 146: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,103 INFO L290 TraceCheckUtils]: 147: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,103 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} #38#return; {3276#(and (<= |main_#t~ret4| 48) (<= 48 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,104 INFO L290 TraceCheckUtils]: 149: Hoare triple {3276#(and (<= |main_#t~ret4| 48) (<= 48 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:34:46,104 INFO L290 TraceCheckUtils]: 150: Hoare triple {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:34:46,104 INFO L272 TraceCheckUtils]: 151: Hoare triple {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,105 INFO L290 TraceCheckUtils]: 152: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,105 INFO L290 TraceCheckUtils]: 153: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,106 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} #38#return; {3281#(and (<= 50 |main_#t~ret4|) (<= |main_#t~ret4| 50))} is VALID [2022-04-27 10:34:46,106 INFO L290 TraceCheckUtils]: 155: Hoare triple {3281#(and (<= 50 |main_#t~ret4|) (<= |main_#t~ret4| 50))} ~x~0 := #t~ret4;havoc #t~ret4; {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:34:46,106 INFO L290 TraceCheckUtils]: 156: Hoare triple {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:34:46,107 INFO L272 TraceCheckUtils]: 157: Hoare triple {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,107 INFO L290 TraceCheckUtils]: 158: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,107 INFO L290 TraceCheckUtils]: 159: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,108 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} #38#return; {3286#(and (<= 52 |main_#t~ret4|) (<= |main_#t~ret4| 52))} is VALID [2022-04-27 10:34:46,108 INFO L290 TraceCheckUtils]: 161: Hoare triple {3286#(and (<= 52 |main_#t~ret4|) (<= |main_#t~ret4| 52))} ~x~0 := #t~ret4;havoc #t~ret4; {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:34:46,109 INFO L290 TraceCheckUtils]: 162: Hoare triple {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:34:46,109 INFO L272 TraceCheckUtils]: 163: Hoare triple {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,109 INFO L290 TraceCheckUtils]: 164: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,110 INFO L290 TraceCheckUtils]: 165: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,110 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} #38#return; {3291#(and (<= 54 |main_#t~ret4|) (<= |main_#t~ret4| 54))} is VALID [2022-04-27 10:34:46,111 INFO L290 TraceCheckUtils]: 167: Hoare triple {3291#(and (<= 54 |main_#t~ret4|) (<= |main_#t~ret4| 54))} ~x~0 := #t~ret4;havoc #t~ret4; {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:34:46,111 INFO L290 TraceCheckUtils]: 168: Hoare triple {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:34:46,111 INFO L272 TraceCheckUtils]: 169: Hoare triple {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,112 INFO L290 TraceCheckUtils]: 170: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,112 INFO L290 TraceCheckUtils]: 171: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,113 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} #38#return; {3296#(and (<= 56 |main_#t~ret4|) (<= |main_#t~ret4| 56))} is VALID [2022-04-27 10:34:46,113 INFO L290 TraceCheckUtils]: 173: Hoare triple {3296#(and (<= 56 |main_#t~ret4|) (<= |main_#t~ret4| 56))} ~x~0 := #t~ret4;havoc #t~ret4; {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:34:46,114 INFO L290 TraceCheckUtils]: 174: Hoare triple {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:34:46,114 INFO L272 TraceCheckUtils]: 175: Hoare triple {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,114 INFO L290 TraceCheckUtils]: 176: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,114 INFO L290 TraceCheckUtils]: 177: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,115 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} #38#return; {3301#(and (<= |main_#t~ret4| 58) (<= 58 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,116 INFO L290 TraceCheckUtils]: 179: Hoare triple {3301#(and (<= |main_#t~ret4| 58) (<= 58 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:34:46,116 INFO L290 TraceCheckUtils]: 180: Hoare triple {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455); {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:34:46,116 INFO L272 TraceCheckUtils]: 181: Hoare triple {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,116 INFO L290 TraceCheckUtils]: 182: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,117 INFO L290 TraceCheckUtils]: 183: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,118 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} #38#return; {3306#(and (<= 60 |main_#t~ret4|) (<= |main_#t~ret4| 60))} is VALID [2022-04-27 10:34:46,118 INFO L290 TraceCheckUtils]: 185: Hoare triple {3306#(and (<= 60 |main_#t~ret4|) (<= |main_#t~ret4| 60))} ~x~0 := #t~ret4;havoc #t~ret4; {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:34:46,118 INFO L290 TraceCheckUtils]: 186: Hoare triple {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:34:46,118 INFO L272 TraceCheckUtils]: 187: Hoare triple {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:34:46,119 INFO L290 TraceCheckUtils]: 188: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,119 INFO L290 TraceCheckUtils]: 189: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:34:46,120 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} #38#return; {3311#(and (<= |main_#t~ret4| 62) (<= 62 |main_#t~ret4|))} is VALID [2022-04-27 10:34:46,120 INFO L290 TraceCheckUtils]: 191: Hoare triple {3311#(and (<= |main_#t~ret4| 62) (<= 62 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3312#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} is VALID [2022-04-27 10:34:46,121 INFO L290 TraceCheckUtils]: 192: Hoare triple {3312#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {3153#false} is VALID [2022-04-27 10:34:46,121 INFO L272 TraceCheckUtils]: 193: Hoare triple {3153#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3153#false} is VALID [2022-04-27 10:34:46,121 INFO L290 TraceCheckUtils]: 194: Hoare triple {3153#false} ~cond := #in~cond; {3153#false} is VALID [2022-04-27 10:34:46,121 INFO L290 TraceCheckUtils]: 195: Hoare triple {3153#false} assume 0 == ~cond; {3153#false} is VALID [2022-04-27 10:34:46,121 INFO L290 TraceCheckUtils]: 196: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2022-04-27 10:34:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-27 10:34:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:34:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897766496] [2022-04-27 10:34:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897766496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:34:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899660152] [2022-04-27 10:34:46,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:34:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:34:46,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:34:46,128 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-04-27 10:34:46,132 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-04-27 10:35:02,768 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-27 10:35:02,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:35:02,782 WARN L261 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 313 conjunts are in the unsatisfiable core [2022-04-27 10:35:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:35:06,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2022-04-27 10:35:06,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3152#true} is VALID [2022-04-27 10:35:06,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-04-27 10:35:06,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #42#return; {3152#true} is VALID [2022-04-27 10:35:06,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret5 := main(); {3152#true} is VALID [2022-04-27 10:35:06,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {3152#true} ~x~0 := 0; {3157#(= main_~x~0 0)} is VALID [2022-04-27 10:35:06,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {3157#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3157#(= main_~x~0 0)} is VALID [2022-04-27 10:35:06,066 INFO L272 TraceCheckUtils]: 7: Hoare triple {3157#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3157#(= main_~x~0 0)} #38#return; {3161#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:35:06,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {3161#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:35:06,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:35:06,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,069 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3162#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #38#return; {3166#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} is VALID [2022-04-27 10:35:06,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {3166#(and (<= 4 |main_#t~ret4|) (<= |main_#t~ret4| 4))} ~x~0 := #t~ret4;havoc #t~ret4; {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:35:06,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:35:06,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,071 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3167#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #38#return; {3171#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} is VALID [2022-04-27 10:35:06,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {3171#(and (<= 6 |main_#t~ret4|) (<= |main_#t~ret4| 6))} ~x~0 := #t~ret4;havoc #t~ret4; {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:35:06,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:35:06,072 INFO L272 TraceCheckUtils]: 25: Hoare triple {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,073 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3172#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #38#return; {3176#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(and (<= |main_#t~ret4| 8) (<= 8 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:35:06,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:35:06,074 INFO L272 TraceCheckUtils]: 31: Hoare triple {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,077 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3177#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #38#return; {3181#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} is VALID [2022-04-27 10:35:06,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {3181#(and (<= 10 |main_#t~ret4|) (<= |main_#t~ret4| 10))} ~x~0 := #t~ret4;havoc #t~ret4; {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:35:06,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:35:06,078 INFO L272 TraceCheckUtils]: 37: Hoare triple {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,079 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #38#return; {3186#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} is VALID [2022-04-27 10:35:06,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= 12 |main_#t~ret4|) (<= |main_#t~ret4| 12))} ~x~0 := #t~ret4;havoc #t~ret4; {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:35:06,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:35:06,080 INFO L272 TraceCheckUtils]: 43: Hoare triple {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,081 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3187#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #38#return; {3191#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {3191#(and (<= |main_#t~ret4| 14) (<= 14 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:35:06,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:35:06,083 INFO L272 TraceCheckUtils]: 49: Hoare triple {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,084 INFO L290 TraceCheckUtils]: 50: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,085 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #38#return; {3196#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} is VALID [2022-04-27 10:35:06,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {3196#(and (<= 16 |main_#t~ret4|) (<= |main_#t~ret4| 16))} ~x~0 := #t~ret4;havoc #t~ret4; {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:35:06,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:35:06,086 INFO L272 TraceCheckUtils]: 55: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,088 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #38#return; {3201#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} is VALID [2022-04-27 10:35:06,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {3201#(and (<= 18 |main_#t~ret4|) (<= |main_#t~ret4| 18))} ~x~0 := #t~ret4;havoc #t~ret4; {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:35:06,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:35:06,089 INFO L272 TraceCheckUtils]: 61: Hoare triple {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,090 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3202#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #38#return; {3206#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {3206#(and (<= |main_#t~ret4| 20) (<= 20 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:35:06,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:35:06,091 INFO L272 TraceCheckUtils]: 67: Hoare triple {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,092 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3207#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #38#return; {3211#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {3211#(and (<= |main_#t~ret4| 22) (<= 22 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:35:06,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:35:06,093 INFO L272 TraceCheckUtils]: 73: Hoare triple {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,094 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3212#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #38#return; {3216#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {3216#(and (<= |main_#t~ret4| 24) (<= 24 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:35:06,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:35:06,095 INFO L272 TraceCheckUtils]: 79: Hoare triple {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,096 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #38#return; {3221#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} is VALID [2022-04-27 10:35:06,096 INFO L290 TraceCheckUtils]: 83: Hoare triple {3221#(and (<= 26 |main_#t~ret4|) (<= |main_#t~ret4| 26))} ~x~0 := #t~ret4;havoc #t~ret4; {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:35:06,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:35:06,097 INFO L272 TraceCheckUtils]: 85: Hoare triple {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,098 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3222#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #38#return; {3226#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {3226#(and (<= |main_#t~ret4| 28) (<= 28 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:35:06,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:35:06,099 INFO L272 TraceCheckUtils]: 91: Hoare triple {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,100 INFO L290 TraceCheckUtils]: 93: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,100 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3227#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #38#return; {3231#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} is VALID [2022-04-27 10:35:06,101 INFO L290 TraceCheckUtils]: 95: Hoare triple {3231#(and (<= 30 |main_#t~ret4|) (<= |main_#t~ret4| 30))} ~x~0 := #t~ret4;havoc #t~ret4; {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:35:06,101 INFO L290 TraceCheckUtils]: 96: Hoare triple {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:35:06,101 INFO L272 TraceCheckUtils]: 97: Hoare triple {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,101 INFO L290 TraceCheckUtils]: 98: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,102 INFO L290 TraceCheckUtils]: 99: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,102 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3232#(and (<= 30 main_~x~0) (<= main_~x~0 30))} #38#return; {3236#(and (<= |main_#t~ret4| 32) (<= 32 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {3236#(and (<= |main_#t~ret4| 32) (<= 32 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:35:06,103 INFO L290 TraceCheckUtils]: 102: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:35:06,103 INFO L272 TraceCheckUtils]: 103: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,103 INFO L290 TraceCheckUtils]: 104: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,104 INFO L290 TraceCheckUtils]: 105: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,104 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} #38#return; {3241#(and (<= 34 |main_#t~ret4|) (<= |main_#t~ret4| 34))} is VALID [2022-04-27 10:35:06,105 INFO L290 TraceCheckUtils]: 107: Hoare triple {3241#(and (<= 34 |main_#t~ret4|) (<= |main_#t~ret4| 34))} ~x~0 := #t~ret4;havoc #t~ret4; {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:35:06,105 INFO L290 TraceCheckUtils]: 108: Hoare triple {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:35:06,105 INFO L272 TraceCheckUtils]: 109: Hoare triple {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,105 INFO L290 TraceCheckUtils]: 110: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,106 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3242#(and (<= main_~x~0 34) (<= 34 main_~x~0))} #38#return; {3246#(and (<= 36 |main_#t~ret4|) (<= |main_#t~ret4| 36))} is VALID [2022-04-27 10:35:06,107 INFO L290 TraceCheckUtils]: 113: Hoare triple {3246#(and (<= 36 |main_#t~ret4|) (<= |main_#t~ret4| 36))} ~x~0 := #t~ret4;havoc #t~ret4; {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:35:06,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:35:06,107 INFO L272 TraceCheckUtils]: 115: Hoare triple {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,107 INFO L290 TraceCheckUtils]: 116: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,108 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3247#(and (<= main_~x~0 36) (<= 36 main_~x~0))} #38#return; {3251#(and (<= 38 |main_#t~ret4|) (<= |main_#t~ret4| 38))} is VALID [2022-04-27 10:35:06,109 INFO L290 TraceCheckUtils]: 119: Hoare triple {3251#(and (<= 38 |main_#t~ret4|) (<= |main_#t~ret4| 38))} ~x~0 := #t~ret4;havoc #t~ret4; {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:35:06,109 INFO L290 TraceCheckUtils]: 120: Hoare triple {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:35:06,109 INFO L272 TraceCheckUtils]: 121: Hoare triple {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,109 INFO L290 TraceCheckUtils]: 122: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,110 INFO L290 TraceCheckUtils]: 123: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,110 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3252#(and (<= main_~x~0 38) (<= 38 main_~x~0))} #38#return; {3256#(and (<= 40 |main_#t~ret4|) (<= |main_#t~ret4| 40))} is VALID [2022-04-27 10:35:06,111 INFO L290 TraceCheckUtils]: 125: Hoare triple {3256#(and (<= 40 |main_#t~ret4|) (<= |main_#t~ret4| 40))} ~x~0 := #t~ret4;havoc #t~ret4; {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:35:06,111 INFO L290 TraceCheckUtils]: 126: Hoare triple {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:35:06,111 INFO L272 TraceCheckUtils]: 127: Hoare triple {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,111 INFO L290 TraceCheckUtils]: 128: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,112 INFO L290 TraceCheckUtils]: 129: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,112 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3257#(and (<= main_~x~0 40) (<= 40 main_~x~0))} #38#return; {3261#(and (<= |main_#t~ret4| 42) (<= 42 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,113 INFO L290 TraceCheckUtils]: 131: Hoare triple {3261#(and (<= |main_#t~ret4| 42) (<= 42 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:35:06,113 INFO L290 TraceCheckUtils]: 132: Hoare triple {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:35:06,113 INFO L272 TraceCheckUtils]: 133: Hoare triple {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,113 INFO L290 TraceCheckUtils]: 134: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,114 INFO L290 TraceCheckUtils]: 135: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,114 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3262#(and (<= main_~x~0 42) (<= 42 main_~x~0))} #38#return; {3266#(and (<= 44 |main_#t~ret4|) (<= |main_#t~ret4| 44))} is VALID [2022-04-27 10:35:06,115 INFO L290 TraceCheckUtils]: 137: Hoare triple {3266#(and (<= 44 |main_#t~ret4|) (<= |main_#t~ret4| 44))} ~x~0 := #t~ret4;havoc #t~ret4; {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:35:06,115 INFO L290 TraceCheckUtils]: 138: Hoare triple {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455); {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:35:06,115 INFO L272 TraceCheckUtils]: 139: Hoare triple {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,115 INFO L290 TraceCheckUtils]: 140: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,116 INFO L290 TraceCheckUtils]: 141: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,116 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3267#(and (<= 44 main_~x~0) (<= main_~x~0 44))} #38#return; {3271#(and (<= 46 |main_#t~ret4|) (<= |main_#t~ret4| 46))} is VALID [2022-04-27 10:35:06,117 INFO L290 TraceCheckUtils]: 143: Hoare triple {3271#(and (<= 46 |main_#t~ret4|) (<= |main_#t~ret4| 46))} ~x~0 := #t~ret4;havoc #t~ret4; {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:35:06,117 INFO L290 TraceCheckUtils]: 144: Hoare triple {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455); {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:35:06,117 INFO L272 TraceCheckUtils]: 145: Hoare triple {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,117 INFO L290 TraceCheckUtils]: 146: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,118 INFO L290 TraceCheckUtils]: 147: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,118 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3272#(and (<= 46 main_~x~0) (<= main_~x~0 46))} #38#return; {3276#(and (<= |main_#t~ret4| 48) (<= 48 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,119 INFO L290 TraceCheckUtils]: 149: Hoare triple {3276#(and (<= |main_#t~ret4| 48) (<= 48 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:35:06,119 INFO L290 TraceCheckUtils]: 150: Hoare triple {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:35:06,119 INFO L272 TraceCheckUtils]: 151: Hoare triple {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,119 INFO L290 TraceCheckUtils]: 152: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,120 INFO L290 TraceCheckUtils]: 153: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,120 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3277#(and (<= main_~x~0 48) (<= 48 main_~x~0))} #38#return; {3281#(and (<= 50 |main_#t~ret4|) (<= |main_#t~ret4| 50))} is VALID [2022-04-27 10:35:06,121 INFO L290 TraceCheckUtils]: 155: Hoare triple {3281#(and (<= 50 |main_#t~ret4|) (<= |main_#t~ret4| 50))} ~x~0 := #t~ret4;havoc #t~ret4; {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:35:06,121 INFO L290 TraceCheckUtils]: 156: Hoare triple {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:35:06,121 INFO L272 TraceCheckUtils]: 157: Hoare triple {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,122 INFO L290 TraceCheckUtils]: 158: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,122 INFO L290 TraceCheckUtils]: 159: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,122 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3282#(and (<= main_~x~0 50) (<= 50 main_~x~0))} #38#return; {3286#(and (<= 52 |main_#t~ret4|) (<= |main_#t~ret4| 52))} is VALID [2022-04-27 10:35:06,123 INFO L290 TraceCheckUtils]: 161: Hoare triple {3286#(and (<= 52 |main_#t~ret4|) (<= |main_#t~ret4| 52))} ~x~0 := #t~ret4;havoc #t~ret4; {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:35:06,123 INFO L290 TraceCheckUtils]: 162: Hoare triple {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:35:06,123 INFO L272 TraceCheckUtils]: 163: Hoare triple {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,124 INFO L290 TraceCheckUtils]: 164: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,124 INFO L290 TraceCheckUtils]: 165: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,124 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3287#(and (<= main_~x~0 52) (<= 52 main_~x~0))} #38#return; {3291#(and (<= 54 |main_#t~ret4|) (<= |main_#t~ret4| 54))} is VALID [2022-04-27 10:35:06,125 INFO L290 TraceCheckUtils]: 167: Hoare triple {3291#(and (<= 54 |main_#t~ret4|) (<= |main_#t~ret4| 54))} ~x~0 := #t~ret4;havoc #t~ret4; {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:35:06,125 INFO L290 TraceCheckUtils]: 168: Hoare triple {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:35:06,125 INFO L272 TraceCheckUtils]: 169: Hoare triple {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,126 INFO L290 TraceCheckUtils]: 170: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,126 INFO L290 TraceCheckUtils]: 171: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,127 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3292#(and (<= main_~x~0 54) (<= 54 main_~x~0))} #38#return; {3296#(and (<= 56 |main_#t~ret4|) (<= |main_#t~ret4| 56))} is VALID [2022-04-27 10:35:06,127 INFO L290 TraceCheckUtils]: 173: Hoare triple {3296#(and (<= 56 |main_#t~ret4|) (<= |main_#t~ret4| 56))} ~x~0 := #t~ret4;havoc #t~ret4; {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:35:06,130 INFO L290 TraceCheckUtils]: 174: Hoare triple {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:35:06,130 INFO L272 TraceCheckUtils]: 175: Hoare triple {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,131 INFO L290 TraceCheckUtils]: 176: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,131 INFO L290 TraceCheckUtils]: 177: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,132 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3297#(and (<= main_~x~0 56) (<= 56 main_~x~0))} #38#return; {3301#(and (<= |main_#t~ret4| 58) (<= 58 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,132 INFO L290 TraceCheckUtils]: 179: Hoare triple {3301#(and (<= |main_#t~ret4| 58) (<= 58 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:35:06,132 INFO L290 TraceCheckUtils]: 180: Hoare triple {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455); {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:35:06,132 INFO L272 TraceCheckUtils]: 181: Hoare triple {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,133 INFO L290 TraceCheckUtils]: 182: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,133 INFO L290 TraceCheckUtils]: 183: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,134 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3302#(and (<= 58 main_~x~0) (<= main_~x~0 58))} #38#return; {3306#(and (<= 60 |main_#t~ret4|) (<= |main_#t~ret4| 60))} is VALID [2022-04-27 10:35:06,134 INFO L290 TraceCheckUtils]: 185: Hoare triple {3306#(and (<= 60 |main_#t~ret4|) (<= |main_#t~ret4| 60))} ~x~0 := #t~ret4;havoc #t~ret4; {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:35:06,134 INFO L290 TraceCheckUtils]: 186: Hoare triple {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:35:06,134 INFO L272 TraceCheckUtils]: 187: Hoare triple {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:06,135 INFO L290 TraceCheckUtils]: 188: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,135 INFO L290 TraceCheckUtils]: 189: Hoare triple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:35:06,136 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {3314#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3307#(and (<= main_~x~0 60) (<= 60 main_~x~0))} #38#return; {3311#(and (<= |main_#t~ret4| 62) (<= 62 |main_#t~ret4|))} is VALID [2022-04-27 10:35:06,136 INFO L290 TraceCheckUtils]: 191: Hoare triple {3311#(and (<= |main_#t~ret4| 62) (<= 62 |main_#t~ret4|))} ~x~0 := #t~ret4;havoc #t~ret4; {3891#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-27 10:35:06,137 INFO L290 TraceCheckUtils]: 192: Hoare triple {3891#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {3153#false} is VALID [2022-04-27 10:35:06,137 INFO L272 TraceCheckUtils]: 193: Hoare triple {3153#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3153#false} is VALID [2022-04-27 10:35:06,137 INFO L290 TraceCheckUtils]: 194: Hoare triple {3153#false} ~cond := #in~cond; {3153#false} is VALID [2022-04-27 10:35:06,137 INFO L290 TraceCheckUtils]: 195: Hoare triple {3153#false} assume 0 == ~cond; {3153#false} is VALID [2022-04-27 10:35:06,137 INFO L290 TraceCheckUtils]: 196: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2022-04-27 10:35:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2022-04-27 10:35:06,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:35:16,545 INFO L290 TraceCheckUtils]: 196: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2022-04-27 10:35:16,545 INFO L290 TraceCheckUtils]: 195: Hoare triple {3153#false} assume 0 == ~cond; {3153#false} is VALID [2022-04-27 10:35:16,545 INFO L290 TraceCheckUtils]: 194: Hoare triple {3153#false} ~cond := #in~cond; {3153#false} is VALID [2022-04-27 10:35:16,545 INFO L272 TraceCheckUtils]: 193: Hoare triple {3153#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3153#false} is VALID [2022-04-27 10:35:16,545 INFO L290 TraceCheckUtils]: 192: Hoare triple {3919#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3153#false} is VALID [2022-04-27 10:35:16,546 INFO L290 TraceCheckUtils]: 191: Hoare triple {3923#(< (mod |main_#t~ret4| 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {3919#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,555 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {3931#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} {3927#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} #38#return; {3923#(< (mod |main_#t~ret4| 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,556 INFO L290 TraceCheckUtils]: 189: Hoare triple {3931#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} assume true; {3931#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,557 INFO L290 TraceCheckUtils]: 188: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3931#(or (< (mod |f_#res| 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 2) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,557 INFO L272 TraceCheckUtils]: 187: Hoare triple {3927#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,557 INFO L290 TraceCheckUtils]: 186: Hoare triple {3927#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3927#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,557 INFO L290 TraceCheckUtils]: 185: Hoare triple {3944#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {3927#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,558 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {3952#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} #38#return; {3944#(< (mod (+ 2 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,558 INFO L290 TraceCheckUtils]: 183: Hoare triple {3952#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} assume true; {3952#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,559 INFO L290 TraceCheckUtils]: 182: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3952#(or (not (< (mod (+ |f_#in~z| 4) 4294967296) 268435455)) (< (mod (+ |f_#res| 2) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,559 INFO L272 TraceCheckUtils]: 181: Hoare triple {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,559 INFO L290 TraceCheckUtils]: 180: Hoare triple {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,560 INFO L290 TraceCheckUtils]: 179: Hoare triple {3965#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,560 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {3973#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} {3969#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} #38#return; {3965#(< (mod (+ |main_#t~ret4| 4) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,561 INFO L290 TraceCheckUtils]: 177: Hoare triple {3973#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} assume true; {3973#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,562 INFO L290 TraceCheckUtils]: 176: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3973#(or (< (mod (+ |f_#res| 4) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 6) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,562 INFO L272 TraceCheckUtils]: 175: Hoare triple {3969#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,563 INFO L290 TraceCheckUtils]: 174: Hoare triple {3969#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3969#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,564 INFO L290 TraceCheckUtils]: 173: Hoare triple {3986#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {3969#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,568 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {3994#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} {3990#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} #38#return; {3986#(< (mod (+ 6 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,569 INFO L290 TraceCheckUtils]: 171: Hoare triple {3994#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} assume true; {3994#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,569 INFO L290 TraceCheckUtils]: 170: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {3994#(or (< (mod (+ |f_#res| 6) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 8) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,569 INFO L272 TraceCheckUtils]: 169: Hoare triple {3990#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,570 INFO L290 TraceCheckUtils]: 168: Hoare triple {3990#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3990#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,570 INFO L290 TraceCheckUtils]: 167: Hoare triple {4007#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {3990#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,571 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {4015#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} {4011#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} #38#return; {4007#(< (mod (+ |main_#t~ret4| 8) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,571 INFO L290 TraceCheckUtils]: 165: Hoare triple {4015#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} assume true; {4015#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,572 INFO L290 TraceCheckUtils]: 164: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4015#(or (< (mod (+ |f_#res| 8) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 10) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,572 INFO L272 TraceCheckUtils]: 163: Hoare triple {4011#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,572 INFO L290 TraceCheckUtils]: 162: Hoare triple {4011#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4011#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,572 INFO L290 TraceCheckUtils]: 161: Hoare triple {4028#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4011#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,573 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {4036#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} {4032#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} #38#return; {4028#(< (mod (+ |main_#t~ret4| 10) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,573 INFO L290 TraceCheckUtils]: 159: Hoare triple {4036#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} assume true; {4036#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,574 INFO L290 TraceCheckUtils]: 158: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4036#(or (< (mod (+ |f_#res| 10) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 12) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,574 INFO L272 TraceCheckUtils]: 157: Hoare triple {4032#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,574 INFO L290 TraceCheckUtils]: 156: Hoare triple {4032#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4032#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,574 INFO L290 TraceCheckUtils]: 155: Hoare triple {4049#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4032#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,575 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {4057#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} {4053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} #38#return; {4049#(< (mod (+ |main_#t~ret4| 12) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,575 INFO L290 TraceCheckUtils]: 153: Hoare triple {4057#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} assume true; {4057#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,576 INFO L290 TraceCheckUtils]: 152: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4057#(or (< (mod (+ |f_#res| 12) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 14) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,576 INFO L272 TraceCheckUtils]: 151: Hoare triple {4053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,576 INFO L290 TraceCheckUtils]: 150: Hoare triple {4053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,577 INFO L290 TraceCheckUtils]: 149: Hoare triple {4070#(< (mod (+ 14 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,577 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {4078#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} {4074#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} #38#return; {4070#(< (mod (+ 14 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,578 INFO L290 TraceCheckUtils]: 147: Hoare triple {4078#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} assume true; {4078#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,578 INFO L290 TraceCheckUtils]: 146: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4078#(or (< (mod (+ |f_#res| 14) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 16) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,578 INFO L272 TraceCheckUtils]: 145: Hoare triple {4074#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,579 INFO L290 TraceCheckUtils]: 144: Hoare triple {4074#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4074#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,579 INFO L290 TraceCheckUtils]: 143: Hoare triple {4091#(< (mod (+ 16 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4074#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,579 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {4099#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} {4095#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} #38#return; {4091#(< (mod (+ 16 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,580 INFO L290 TraceCheckUtils]: 141: Hoare triple {4099#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} assume true; {4099#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,580 INFO L290 TraceCheckUtils]: 140: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4099#(or (< (mod (+ |f_#res| 16) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 18) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,581 INFO L272 TraceCheckUtils]: 139: Hoare triple {4095#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,581 INFO L290 TraceCheckUtils]: 138: Hoare triple {4095#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4095#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,581 INFO L290 TraceCheckUtils]: 137: Hoare triple {4112#(< (mod (+ |main_#t~ret4| 18) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4095#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,582 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {4120#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} {4116#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} #38#return; {4112#(< (mod (+ |main_#t~ret4| 18) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,584 INFO L290 TraceCheckUtils]: 135: Hoare triple {4120#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} assume true; {4120#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,585 INFO L290 TraceCheckUtils]: 134: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4120#(or (< (mod (+ |f_#res| 18) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 20) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,585 INFO L272 TraceCheckUtils]: 133: Hoare triple {4116#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,586 INFO L290 TraceCheckUtils]: 132: Hoare triple {4116#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4116#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,586 INFO L290 TraceCheckUtils]: 131: Hoare triple {4133#(< (mod (+ |main_#t~ret4| 20) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4116#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,587 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {4141#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} {4137#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} #38#return; {4133#(< (mod (+ |main_#t~ret4| 20) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,587 INFO L290 TraceCheckUtils]: 129: Hoare triple {4141#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} assume true; {4141#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,588 INFO L290 TraceCheckUtils]: 128: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4141#(or (< (mod (+ |f_#res| 20) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 22) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,588 INFO L272 TraceCheckUtils]: 127: Hoare triple {4137#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,588 INFO L290 TraceCheckUtils]: 126: Hoare triple {4137#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4137#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,588 INFO L290 TraceCheckUtils]: 125: Hoare triple {4154#(< (mod (+ 22 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4137#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,589 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {4162#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} {4158#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} #38#return; {4154#(< (mod (+ 22 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,589 INFO L290 TraceCheckUtils]: 123: Hoare triple {4162#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} assume true; {4162#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,590 INFO L290 TraceCheckUtils]: 122: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4162#(or (< (mod (+ |f_#res| 22) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 24) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,590 INFO L272 TraceCheckUtils]: 121: Hoare triple {4158#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,590 INFO L290 TraceCheckUtils]: 120: Hoare triple {4158#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4158#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,590 INFO L290 TraceCheckUtils]: 119: Hoare triple {4175#(< (mod (+ |main_#t~ret4| 24) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4158#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,591 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {4183#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} {4179#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} #38#return; {4175#(< (mod (+ |main_#t~ret4| 24) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,591 INFO L290 TraceCheckUtils]: 117: Hoare triple {4183#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} assume true; {4183#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,592 INFO L290 TraceCheckUtils]: 116: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4183#(or (not (< (mod (+ |f_#in~z| 26) 4294967296) 268435455)) (< (mod (+ |f_#res| 24) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,592 INFO L272 TraceCheckUtils]: 115: Hoare triple {4179#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,592 INFO L290 TraceCheckUtils]: 114: Hoare triple {4179#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4179#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,593 INFO L290 TraceCheckUtils]: 113: Hoare triple {4196#(< (mod (+ |main_#t~ret4| 26) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4179#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,593 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {4204#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} {4200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} #38#return; {4196#(< (mod (+ |main_#t~ret4| 26) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,594 INFO L290 TraceCheckUtils]: 111: Hoare triple {4204#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} assume true; {4204#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,594 INFO L290 TraceCheckUtils]: 110: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4204#(or (not (< (mod (+ |f_#in~z| 28) 4294967296) 268435455)) (< (mod (+ |f_#res| 26) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,594 INFO L272 TraceCheckUtils]: 109: Hoare triple {4200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,595 INFO L290 TraceCheckUtils]: 108: Hoare triple {4200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,595 INFO L290 TraceCheckUtils]: 107: Hoare triple {4217#(< (mod (+ |main_#t~ret4| 28) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,596 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {4225#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} {4221#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} #38#return; {4217#(< (mod (+ |main_#t~ret4| 28) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,596 INFO L290 TraceCheckUtils]: 105: Hoare triple {4225#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} assume true; {4225#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,599 INFO L290 TraceCheckUtils]: 104: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4225#(or (< (mod (+ |f_#res| 28) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 30) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,599 INFO L272 TraceCheckUtils]: 103: Hoare triple {4221#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {4221#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4221#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {4238#(< (mod (+ 30 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4221#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,605 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {4246#(or (not (< (mod (+ |f_#in~z| 32) 4294967296) 268435455)) (< (mod (+ |f_#res| 30) 4294967296) 268435455))} {4242#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} #38#return; {4238#(< (mod (+ 30 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,605 INFO L290 TraceCheckUtils]: 99: Hoare triple {4246#(or (not (< (mod (+ |f_#in~z| 32) 4294967296) 268435455)) (< (mod (+ |f_#res| 30) 4294967296) 268435455))} assume true; {4246#(or (not (< (mod (+ |f_#in~z| 32) 4294967296) 268435455)) (< (mod (+ |f_#res| 30) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4246#(or (not (< (mod (+ |f_#in~z| 32) 4294967296) 268435455)) (< (mod (+ |f_#res| 30) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,606 INFO L272 TraceCheckUtils]: 97: Hoare triple {4242#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,607 INFO L290 TraceCheckUtils]: 96: Hoare triple {4242#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4242#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,607 INFO L290 TraceCheckUtils]: 95: Hoare triple {4259#(< (mod (+ 32 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4242#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,608 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {4267#(or (< (mod (+ |f_#res| 32) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 34) 4294967296) 268435455)))} {4263#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} #38#return; {4259#(< (mod (+ 32 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {4267#(or (< (mod (+ |f_#res| 32) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 34) 4294967296) 268435455)))} assume true; {4267#(or (< (mod (+ |f_#res| 32) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 34) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,609 INFO L290 TraceCheckUtils]: 92: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4267#(or (< (mod (+ |f_#res| 32) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 34) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,609 INFO L272 TraceCheckUtils]: 91: Hoare triple {4263#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,610 INFO L290 TraceCheckUtils]: 90: Hoare triple {4263#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4263#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,610 INFO L290 TraceCheckUtils]: 89: Hoare triple {4280#(< (mod (+ 34 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4263#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,611 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {4288#(or (not (< (mod (+ |f_#in~z| 36) 4294967296) 268435455)) (< (mod (+ |f_#res| 34) 4294967296) 268435455))} {4284#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} #38#return; {4280#(< (mod (+ 34 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,612 INFO L290 TraceCheckUtils]: 87: Hoare triple {4288#(or (not (< (mod (+ |f_#in~z| 36) 4294967296) 268435455)) (< (mod (+ |f_#res| 34) 4294967296) 268435455))} assume true; {4288#(or (not (< (mod (+ |f_#in~z| 36) 4294967296) 268435455)) (< (mod (+ |f_#res| 34) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4288#(or (not (< (mod (+ |f_#in~z| 36) 4294967296) 268435455)) (< (mod (+ |f_#res| 34) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,613 INFO L272 TraceCheckUtils]: 85: Hoare triple {4284#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,613 INFO L290 TraceCheckUtils]: 84: Hoare triple {4284#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4284#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {4301#(< (mod (+ |main_#t~ret4| 36) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4284#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,614 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4309#(or (not (< (mod (+ |f_#in~z| 38) 4294967296) 268435455)) (< (mod (+ |f_#res| 36) 4294967296) 268435455))} {4305#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} #38#return; {4301#(< (mod (+ |main_#t~ret4| 36) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,615 INFO L290 TraceCheckUtils]: 81: Hoare triple {4309#(or (not (< (mod (+ |f_#in~z| 38) 4294967296) 268435455)) (< (mod (+ |f_#res| 36) 4294967296) 268435455))} assume true; {4309#(or (not (< (mod (+ |f_#in~z| 38) 4294967296) 268435455)) (< (mod (+ |f_#res| 36) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4309#(or (not (< (mod (+ |f_#in~z| 38) 4294967296) 268435455)) (< (mod (+ |f_#res| 36) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,616 INFO L272 TraceCheckUtils]: 79: Hoare triple {4305#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {4305#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4305#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {4322#(< (mod (+ |main_#t~ret4| 38) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4305#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,618 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {4330#(or (< (mod (+ |f_#res| 38) 4294967296) 268435455) (not (< (mod (+ 40 |f_#in~z|) 4294967296) 268435455)))} {4326#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} #38#return; {4322#(< (mod (+ |main_#t~ret4| 38) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {4330#(or (< (mod (+ |f_#res| 38) 4294967296) 268435455) (not (< (mod (+ 40 |f_#in~z|) 4294967296) 268435455)))} assume true; {4330#(or (< (mod (+ |f_#res| 38) 4294967296) 268435455) (not (< (mod (+ 40 |f_#in~z|) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,619 INFO L290 TraceCheckUtils]: 74: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4330#(or (< (mod (+ |f_#res| 38) 4294967296) 268435455) (not (< (mod (+ 40 |f_#in~z|) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,620 INFO L272 TraceCheckUtils]: 73: Hoare triple {4326#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {4326#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4326#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {4343#(< (mod (+ 40 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4326#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,621 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4351#(or (not (< (mod (+ |f_#in~z| 42) 4294967296) 268435455)) (< (mod (+ 40 |f_#res|) 4294967296) 268435455))} {4347#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} #38#return; {4343#(< (mod (+ 40 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {4351#(or (not (< (mod (+ |f_#in~z| 42) 4294967296) 268435455)) (< (mod (+ 40 |f_#res|) 4294967296) 268435455))} assume true; {4351#(or (not (< (mod (+ |f_#in~z| 42) 4294967296) 268435455)) (< (mod (+ 40 |f_#res|) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4351#(or (not (< (mod (+ |f_#in~z| 42) 4294967296) 268435455)) (< (mod (+ 40 |f_#res|) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,623 INFO L272 TraceCheckUtils]: 67: Hoare triple {4347#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {4347#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4347#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {4364#(< (mod (+ 42 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4347#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,624 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4372#(or (not (< (mod (+ |f_#in~z| 44) 4294967296) 268435455)) (< (mod (+ |f_#res| 42) 4294967296) 268435455))} {4368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} #38#return; {4364#(< (mod (+ 42 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {4372#(or (not (< (mod (+ |f_#in~z| 44) 4294967296) 268435455)) (< (mod (+ |f_#res| 42) 4294967296) 268435455))} assume true; {4372#(or (not (< (mod (+ |f_#in~z| 44) 4294967296) 268435455)) (< (mod (+ |f_#res| 42) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4372#(or (not (< (mod (+ |f_#in~z| 44) 4294967296) 268435455)) (< (mod (+ |f_#res| 42) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,626 INFO L272 TraceCheckUtils]: 61: Hoare triple {4368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {4368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {4385#(< (mod (+ 44 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,627 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4393#(or (< (mod (+ |f_#res| 44) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 46) 4294967296) 268435455)))} {4389#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} #38#return; {4385#(< (mod (+ 44 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {4393#(or (< (mod (+ |f_#res| 44) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 46) 4294967296) 268435455)))} assume true; {4393#(or (< (mod (+ |f_#res| 44) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 46) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4393#(or (< (mod (+ |f_#res| 44) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 46) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,629 INFO L272 TraceCheckUtils]: 55: Hoare triple {4389#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {4389#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4389#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {4406#(< (mod (+ 46 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4389#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,630 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4414#(or (< (mod (+ |f_#res| 46) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 48) 4294967296) 268435455)))} {4410#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} #38#return; {4406#(< (mod (+ 46 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {4414#(or (< (mod (+ |f_#res| 46) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 48) 4294967296) 268435455)))} assume true; {4414#(or (< (mod (+ |f_#res| 46) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 48) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4414#(or (< (mod (+ |f_#res| 46) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 48) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,632 INFO L272 TraceCheckUtils]: 49: Hoare triple {4410#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {4410#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4410#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {4427#(< (mod (+ 48 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4410#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,635 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4435#(or (not (< (mod (+ |f_#in~z| 50) 4294967296) 268435455)) (< (mod (+ |f_#res| 48) 4294967296) 268435455))} {4431#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} #38#return; {4427#(< (mod (+ 48 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {4435#(or (not (< (mod (+ |f_#in~z| 50) 4294967296) 268435455)) (< (mod (+ |f_#res| 48) 4294967296) 268435455))} assume true; {4435#(or (not (< (mod (+ |f_#in~z| 50) 4294967296) 268435455)) (< (mod (+ |f_#res| 48) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4435#(or (not (< (mod (+ |f_#in~z| 50) 4294967296) 268435455)) (< (mod (+ |f_#res| 48) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,643 INFO L272 TraceCheckUtils]: 43: Hoare triple {4431#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4431#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {4448#(< (mod (+ |main_#t~ret4| 50) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4431#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,645 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4456#(or (< (mod (+ |f_#res| 50) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 52) 4294967296) 268435455)))} {4452#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} #38#return; {4448#(< (mod (+ |main_#t~ret4| 50) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {4456#(or (< (mod (+ |f_#res| 50) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 52) 4294967296) 268435455)))} assume true; {4456#(or (< (mod (+ |f_#res| 50) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 52) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4456#(or (< (mod (+ |f_#res| 50) 4294967296) 268435455) (not (< (mod (+ |f_#in~z| 52) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,646 INFO L272 TraceCheckUtils]: 37: Hoare triple {4452#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {4452#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4452#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {4469#(< (mod (+ 52 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4452#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,648 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4477#(or (not (< (mod (+ |f_#in~z| 54) 4294967296) 268435455)) (< (mod (+ |f_#res| 52) 4294967296) 268435455))} {4473#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} #38#return; {4469#(< (mod (+ 52 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {4477#(or (not (< (mod (+ |f_#in~z| 54) 4294967296) 268435455)) (< (mod (+ |f_#res| 52) 4294967296) 268435455))} assume true; {4477#(or (not (< (mod (+ |f_#in~z| 54) 4294967296) 268435455)) (< (mod (+ |f_#res| 52) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4477#(or (not (< (mod (+ |f_#in~z| 54) 4294967296) 268435455)) (< (mod (+ |f_#res| 52) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,649 INFO L272 TraceCheckUtils]: 31: Hoare triple {4473#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {4473#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4473#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {4490#(< (mod (+ |main_#t~ret4| 54) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4473#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,651 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4498#(or (< (mod (+ |f_#res| 54) 4294967296) 268435455) (not (< (mod (+ 56 |f_#in~z|) 4294967296) 268435455)))} {4494#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} #38#return; {4490#(< (mod (+ |main_#t~ret4| 54) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {4498#(or (< (mod (+ |f_#res| 54) 4294967296) 268435455) (not (< (mod (+ 56 |f_#in~z|) 4294967296) 268435455)))} assume true; {4498#(or (< (mod (+ |f_#res| 54) 4294967296) 268435455) (not (< (mod (+ 56 |f_#in~z|) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4498#(or (< (mod (+ |f_#res| 54) 4294967296) 268435455) (not (< (mod (+ 56 |f_#in~z|) 4294967296) 268435455)))} is VALID [2022-04-27 10:35:16,652 INFO L272 TraceCheckUtils]: 25: Hoare triple {4494#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {4494#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4494#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {4511#(< (mod (+ 56 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4494#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,654 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4519#(or (not (< (mod (+ |f_#in~z| 58) 4294967296) 268435455)) (< (mod (+ 56 |f_#res|) 4294967296) 268435455))} {4515#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} #38#return; {4511#(< (mod (+ 56 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {4519#(or (not (< (mod (+ |f_#in~z| 58) 4294967296) 268435455)) (< (mod (+ 56 |f_#res|) 4294967296) 268435455))} assume true; {4519#(or (not (< (mod (+ |f_#in~z| 58) 4294967296) 268435455)) (< (mod (+ 56 |f_#res|) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4519#(or (not (< (mod (+ |f_#in~z| 58) 4294967296) 268435455)) (< (mod (+ 56 |f_#res|) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,655 INFO L272 TraceCheckUtils]: 19: Hoare triple {4515#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {4515#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4515#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {4532#(< (mod (+ |main_#t~ret4| 58) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4515#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,656 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4540#(or (not (< (mod (+ |f_#in~z| 60) 4294967296) 268435455)) (< (mod (+ |f_#res| 58) 4294967296) 268435455))} {4536#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} #38#return; {4532#(< (mod (+ |main_#t~ret4| 58) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {4540#(or (not (< (mod (+ |f_#in~z| 60) 4294967296) 268435455)) (< (mod (+ |f_#res| 58) 4294967296) 268435455))} assume true; {4540#(or (not (< (mod (+ |f_#in~z| 60) 4294967296) 268435455)) (< (mod (+ |f_#res| 58) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4540#(or (not (< (mod (+ |f_#in~z| 60) 4294967296) 268435455)) (< (mod (+ |f_#res| 58) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {4536#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {4536#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4536#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {4553#(< (mod (+ 60 |main_#t~ret4|) 4294967296) 268435455)} ~x~0 := #t~ret4;havoc #t~ret4; {4536#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4561#(or (not (< (mod (+ |f_#in~z| 62) 4294967296) 268435455)) (< (mod (+ |f_#res| 60) 4294967296) 268435455))} {4557#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} #38#return; {4553#(< (mod (+ 60 |main_#t~ret4|) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {4561#(or (not (< (mod (+ |f_#in~z| 62) 4294967296) 268435455)) (< (mod (+ |f_#res| 60) 4294967296) 268435455))} assume true; {4561#(or (not (< (mod (+ |f_#in~z| 62) 4294967296) 268435455)) (< (mod (+ |f_#res| 60) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {3152#true} ~z := #in~z;#res := 2 + ~z; {4561#(or (not (< (mod (+ |f_#in~z| 62) 4294967296) 268435455)) (< (mod (+ |f_#res| 60) 4294967296) 268435455))} is VALID [2022-04-27 10:35:16,659 INFO L272 TraceCheckUtils]: 7: Hoare triple {4557#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} call #t~ret4 := f(~x~0); {3152#true} is VALID [2022-04-27 10:35:16,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {4557#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4557#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3152#true} ~x~0 := 0; {4557#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-27 10:35:16,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret5 := main(); {3152#true} is VALID [2022-04-27 10:35:16,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #42#return; {3152#true} is VALID [2022-04-27 10:35:16,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2022-04-27 10:35:16,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3152#true} is VALID [2022-04-27 10:35:16,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2022-04-27 10:35:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-27 10:35:16,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899660152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:35:16,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:35:16,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 96] total 162 [2022-04-27 10:35:16,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861843855] [2022-04-27 10:35:16,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:35:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Word has length 197 [2022-04-27 10:35:16,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:35:16,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-27 10:35:16,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:35:16,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2022-04-27 10:35:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:35:16,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2022-04-27 10:35:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2401, Invalid=23681, Unknown=0, NotChecked=0, Total=26082 [2022-04-27 10:35:16,890 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 162 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 99 states have internal predecessors, (200), 64 states have call successors, (66), 3 states have call predecessors, (66), 33 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-27 10:37:01,962 WARN L232 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 136 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:38:29,950 WARN L232 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 132 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:38:32,352 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 58) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-27 10:39:53,945 WARN L232 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:41:06,310 WARN L232 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 128 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:41:08,857 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 56 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-04-27 10:43:41,897 WARN L232 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 124 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:43:44,373 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 16 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 52 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 50) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 10) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 12) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 38) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 28) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 20) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 24) 4294967296) 268435455) (< (mod (+ 34 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 26) 4294967296) 268435455) (< (mod (+ 46 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 18) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 36) 4294967296) 268435455) (< (mod (+ 32 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 4) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 48) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 30 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 6 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 54) 4294967296) 268435455) (< (mod |c_main_#t~ret4| 4294967296) 268435455) (< (mod (+ 44 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 |c_main_#t~ret4|) 4294967296) 268435455) (< (mod (+ |c_main_#t~ret4| 8) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false