/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:30:16,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:30:16,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:30:16,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:30:16,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:30:16,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:30:16,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:30:16,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:30:16,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:30:16,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:30:16,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:30:16,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:30:16,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:30:16,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:30:16,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:30:16,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:30:16,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:30:16,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:30:16,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:30:16,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:30:16,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:30:16,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:30:16,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:30:16,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:30:16,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:30:16,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:30:16,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:30:16,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:30:16,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:30:16,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:30:16,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:30:16,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:30:16,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:30:16,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:30:16,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:30:16,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:30:16,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:30:16,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:30:16,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:30:16,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:30:16,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:30:16,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:30:16,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:30:16,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:30:16,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:30:16,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:30:16,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:30:16,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:30:16,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:30:16,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:30:16,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:30:16,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:30:16,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:30:16,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:30:16,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:30:16,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:30:16,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:30:16,917 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 09:30:17,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:30:17,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:30:17,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:30:17,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:30:17,133 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:30:17,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-28 09:30:17,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7f69bfb/ca029536b90147ad936f2adff5d7364c/FLAG826253e47 [2022-04-28 09:30:17,514 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:30:17,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-04-28 09:30:17,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7f69bfb/ca029536b90147ad936f2adff5d7364c/FLAG826253e47 [2022-04-28 09:30:17,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7f69bfb/ca029536b90147ad936f2adff5d7364c [2022-04-28 09:30:17,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:30:17,938 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:30:17,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:30:17,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:30:17,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:30:17,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:30:17" (1/1) ... [2022-04-28 09:30:17,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2508fa48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:17, skipping insertion in model container [2022-04-28 09:30:17,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:30:17" (1/1) ... [2022-04-28 09:30:17,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:30:17,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:30:18,066 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-invgen/heapsort.i[893,906] [2022-04-28 09:30:18,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:30:18,092 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:30:18,119 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-invgen/heapsort.i[893,906] [2022-04-28 09:30:18,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:30:18,140 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:30:18,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18 WrapperNode [2022-04-28 09:30:18,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:30:18,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:30:18,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:30:18,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:30:18,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:30:18,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:30:18,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:30:18,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:30:18,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (1/1) ... [2022-04-28 09:30:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:30:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:18,194 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-28 09:30:18,213 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-28 09:30:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:30:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:30:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:30:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:30:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:30:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:30:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:30:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:30:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:30:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:30:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:30:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:30:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:30:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:30:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:30:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:30:18,293 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:30:18,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:30:18,545 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:30:18,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:30:18,554 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:30:18,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:30:18 BoogieIcfgContainer [2022-04-28 09:30:18,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:30:18,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:30:18,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:30:18,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:30:18,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:30:17" (1/3) ... [2022-04-28 09:30:18,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d73f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:30:18, skipping insertion in model container [2022-04-28 09:30:18,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:18" (2/3) ... [2022-04-28 09:30:18,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d73f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:30:18, skipping insertion in model container [2022-04-28 09:30:18,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:30:18" (3/3) ... [2022-04-28 09:30:18,562 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-04-28 09:30:18,572 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:30:18,572 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:30:18,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:30:18,625 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@459a4301, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fc9325f [2022-04-28 09:30:18,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:30:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 09:30:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:30:18,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:18,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:18,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-04-28 09:30:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:18,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282725570] [2022-04-28 09:30:18,659 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 2 times [2022-04-28 09:30:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231884017] [2022-04-28 09:30:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:18,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:18,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#(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(9, 2); {47#true} is VALID [2022-04-28 09:30:18,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-28 09:30:18,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-28 09:30:18,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:18,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(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(9, 2); {47#true} is VALID [2022-04-28 09:30:18,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2022-04-28 09:30:18,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #138#return; {47#true} is VALID [2022-04-28 09:30:18,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {47#true} is VALID [2022-04-28 09:30:18,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {47#true} is VALID [2022-04-28 09:30:18,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {47#true} is VALID [2022-04-28 09:30:18,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {47#true} is VALID [2022-04-28 09:30:18,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52#(<= 1 main_~r~0)} is VALID [2022-04-28 09:30:18,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#(<= 1 main_~r~0)} assume !(~j~0 <= ~r~0); {52#(<= 1 main_~r~0)} is VALID [2022-04-28 09:30:18,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#(<= 1 main_~r~0)} assume !(~l~0 > 1); {52#(<= 1 main_~r~0)} is VALID [2022-04-28 09:30:18,927 INFO L272 TraceCheckUtils]: 11: Hoare triple {52#(<= 1 main_~r~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {53#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:18,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {54#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:18,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48#false} is VALID [2022-04-28 09:30:18,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-04-28 09:30:18,928 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-28 09:30:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231884017] [2022-04-28 09:30:18,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231884017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:18,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:18,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:18,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282725570] [2022-04-28 09:30:18,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282725570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:18,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:18,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901854081] [2022-04-28 09:30:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:18,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:18,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:18,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:30:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:30:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:30:18,978 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:19,632 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-04-28 09:30:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:30:19,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 09:30:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 09:30:19,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-28 09:30:19,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:19,813 INFO L225 Difference]: With dead ends: 88 [2022-04-28 09:30:19,813 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 09:30:19,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:30:19,817 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:19,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 09:30:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 09:30:19,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:19,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:19,862 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:19,862 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:19,865 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-28 09:30:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-28 09:30:19,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:19,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:19,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-28 09:30:19,867 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 44 states. [2022-04-28 09:30:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:19,869 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-04-28 09:30:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2022-04-28 09:30:19,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:19,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:19,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:19,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-28 09:30:19,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-04-28 09:30:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:19,874 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-28 09:30:19,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:19,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 61 transitions. [2022-04-28 09:30:19,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-28 09:30:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:30:19,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:19,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:19,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:30:19,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-04-28 09:30:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206577317] [2022-04-28 09:30:19,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 2 times [2022-04-28 09:30:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025206452] [2022-04-28 09:30:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:19,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:19,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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(9, 2); {417#true} is VALID [2022-04-28 09:30:19,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 09:30:19,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-28 09:30:19,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:19,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(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(9, 2); {417#true} is VALID [2022-04-28 09:30:19,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 09:30:19,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #138#return; {417#true} is VALID [2022-04-28 09:30:19,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {417#true} is VALID [2022-04-28 09:30:19,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {417#true} is VALID [2022-04-28 09:30:19,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {417#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {417#true} is VALID [2022-04-28 09:30:19,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {417#true} is VALID [2022-04-28 09:30:19,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {417#true} is VALID [2022-04-28 09:30:19,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} assume !(~j~0 <= ~r~0); {417#true} is VALID [2022-04-28 09:30:19,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {417#true} assume ~l~0 > 1; {422#(<= 1 main_~l~0)} is VALID [2022-04-28 09:30:19,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#(<= 1 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {423#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:19,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {423#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {424#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:19,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {418#false} is VALID [2022-04-28 09:30:19,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 09:30:19,987 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-28 09:30:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:19,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025206452] [2022-04-28 09:30:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025206452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:19,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:19,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:19,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:19,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206577317] [2022-04-28 09:30:19,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206577317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:19,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:19,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679635184] [2022-04-28 09:30:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:19,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:19,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:19,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:19,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:30:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:30:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:30:19,999 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:20,622 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-04-28 09:30:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:30:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 09:30:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-04-28 09:30:20,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2022-04-28 09:30:20,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:20,709 INFO L225 Difference]: With dead ends: 71 [2022-04-28 09:30:20,710 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 09:30:20,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:30:20,711 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:20,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 09:30:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-28 09:30:20,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:20,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:20,741 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:20,742 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:20,745 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-28 09:30:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-28 09:30:20,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:20,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:20,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-28 09:30:20,747 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 69 states. [2022-04-28 09:30:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:20,750 INFO L93 Difference]: Finished difference Result 69 states and 103 transitions. [2022-04-28 09:30:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-04-28 09:30:20,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:20,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:20,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:20,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 09:30:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-28 09:30:20,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-04-28 09:30:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:20,753 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-28 09:30:20,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-28 09:30:20,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 64 transitions. [2022-04-28 09:30:20,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-28 09:30:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:30:20,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:20,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:20,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:30:20,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-04-28 09:30:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388529875] [2022-04-28 09:30:20,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 2 times [2022-04-28 09:30:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770951888] [2022-04-28 09:30:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:20,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(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(9, 2); {811#true} is VALID [2022-04-28 09:30:20,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-28 09:30:20,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-28 09:30:20,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:20,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(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(9, 2); {811#true} is VALID [2022-04-28 09:30:20,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2022-04-28 09:30:20,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {811#true} {811#true} #138#return; {811#true} is VALID [2022-04-28 09:30:20,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {811#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {811#true} is VALID [2022-04-28 09:30:20,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {811#true} is VALID [2022-04-28 09:30:20,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {811#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {811#true} is VALID [2022-04-28 09:30:20,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {811#true} is VALID [2022-04-28 09:30:20,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {816#(<= 2 main_~r~0)} is VALID [2022-04-28 09:30:20,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#(<= 2 main_~r~0)} assume !!(~j~0 <= ~r~0); {816#(<= 2 main_~r~0)} is VALID [2022-04-28 09:30:20,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(<= 2 main_~r~0)} assume !(~j~0 < ~r~0); {817#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:20,881 INFO L272 TraceCheckUtils]: 11: Hoare triple {817#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:20,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {818#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:20,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {812#false} is VALID [2022-04-28 09:30:20,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#false} assume !false; {812#false} is VALID [2022-04-28 09:30:20,882 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-28 09:30:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:20,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770951888] [2022-04-28 09:30:20,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770951888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:20,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:20,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:20,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388529875] [2022-04-28 09:30:20,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388529875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:20,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626480158] [2022-04-28 09:30:20,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:20,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:20,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:20,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:20,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:30:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:20,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:30:20,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:30:20,894 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:21,698 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-04-28 09:30:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 09:30:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 09:30:21,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-28 09:30:21,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:21,807 INFO L225 Difference]: With dead ends: 80 [2022-04-28 09:30:21,807 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 09:30:21,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:30:21,808 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:21,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 65 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 09:30:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-04-28 09:30:21,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:21,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 09:30:21,879 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 09:30:21,880 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 09:30:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:21,883 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-28 09:30:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-28 09:30:21,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:21,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:21,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-28 09:30:21,884 INFO L87 Difference]: Start difference. First operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 78 states. [2022-04-28 09:30:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:21,887 INFO L93 Difference]: Finished difference Result 78 states and 113 transitions. [2022-04-28 09:30:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2022-04-28 09:30:21,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:21,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:21,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:21,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 09:30:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-04-28 09:30:21,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-04-28 09:30:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:21,890 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-04-28 09:30:21,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:21,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 98 transitions. [2022-04-28 09:30:21,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-04-28 09:30:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:30:21,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:21,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:21,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:30:21,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-04-28 09:30:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001904827] [2022-04-28 09:30:21,982 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 2 times [2022-04-28 09:30:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695976706] [2022-04-28 09:30:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:22,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#(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(9, 2); {1287#true} is VALID [2022-04-28 09:30:22,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-28 09:30:22,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {1287#true} call ULTIMATE.init(); {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:22,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#(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(9, 2); {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#true} assume true; {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1287#true} {1287#true} #138#return; {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1287#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1287#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1287#true} is VALID [2022-04-28 09:30:22,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1287#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1287#true} is VALID [2022-04-28 09:30:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1287#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1292#(<= 1 main_~l~0)} is VALID [2022-04-28 09:30:22,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1292#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:22,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {1293#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:22,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1293#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {1293#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:22,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {1293#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:22,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1295#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:22,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1288#false} is VALID [2022-04-28 09:30:22,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1288#false} assume !false; {1288#false} is VALID [2022-04-28 09:30:22,035 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-28 09:30:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:22,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695976706] [2022-04-28 09:30:22,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695976706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:22,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:22,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:22,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:22,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001904827] [2022-04-28 09:30:22,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001904827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:22,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:22,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625165751] [2022-04-28 09:30:22,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:22,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:22,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:22,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:22,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:30:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:30:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:30:22,046 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:22,898 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-04-28 09:30:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 09:30:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 09:30:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-04-28 09:30:22,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-04-28 09:30:23,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:23,003 INFO L225 Difference]: With dead ends: 122 [2022-04-28 09:30:23,003 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 09:30:23,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:30:23,004 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:23,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 09:30:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-04-28 09:30:23,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:23,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:23,142 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:23,142 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:23,148 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-28 09:30:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-28 09:30:23,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:23,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-28 09:30:23,150 INFO L87 Difference]: Start difference. First operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 120 states. [2022-04-28 09:30:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:23,156 INFO L93 Difference]: Finished difference Result 120 states and 181 transitions. [2022-04-28 09:30:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2022-04-28 09:30:23,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:23,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:23,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:23,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-04-28 09:30:23,161 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-04-28 09:30:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:23,161 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-04-28 09:30:23,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 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-28 09:30:23,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 140 transitions. [2022-04-28 09:30:23,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-04-28 09:30:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:30:23,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:23,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:23,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:30:23,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-04-28 09:30:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:23,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633905346] [2022-04-28 09:30:23,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 2 times [2022-04-28 09:30:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:23,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542578981] [2022-04-28 09:30:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:23,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {1996#(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(9, 2); {1984#true} is VALID [2022-04-28 09:30:23,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 09:30:23,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-28 09:30:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:23,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-28 09:30:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-28 09:30:23,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 09:30:23,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1996#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:23,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {1996#(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(9, 2); {1984#true} is VALID [2022-04-28 09:30:23,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 09:30:23,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #138#return; {1984#true} is VALID [2022-04-28 09:30:23,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1984#true} is VALID [2022-04-28 09:30:23,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1984#true} is VALID [2022-04-28 09:30:23,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {1984#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~j~0 <= ~r~0); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(<= main_~r~0 main_~n~0)} assume !(~l~0 > 1); {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~r~0 then 1 else 0)); {1984#true} is VALID [2022-04-28 09:30:23,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#true} ~cond := #in~cond; {1984#true} is VALID [2022-04-28 09:30:23,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#true} assume !(0 == ~cond); {1984#true} is VALID [2022-04-28 09:30:23,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-28 09:30:23,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1984#true} {1989#(<= main_~r~0 main_~n~0)} #134#return; {1989#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:23,361 INFO L272 TraceCheckUtils]: 16: Hoare triple {1989#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~r~0 <= ~n~0 then 1 else 0)); {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:23,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {1994#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1995#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:23,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1985#false} is VALID [2022-04-28 09:30:23,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-28 09:30:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542578981] [2022-04-28 09:30:23,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542578981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:23,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:23,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:23,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633905346] [2022-04-28 09:30:23,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633905346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:23,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:23,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396192351] [2022-04-28 09:30:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:23,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:23,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:23,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:30:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:30:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:30:23,376 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:23,868 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-04-28 09:30:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:30:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 09:30:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 09:30:23,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 09:30:23,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:23,942 INFO L225 Difference]: With dead ends: 100 [2022-04-28 09:30:23,942 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 09:30:23,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:30:23,943 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:30:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 09:30:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-28 09:30:24,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:24,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:24,100 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:24,100 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:24,104 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-28 09:30:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 09:30:24,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:24,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:24,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-28 09:30:24,106 INFO L87 Difference]: Start difference. First operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 98 states. [2022-04-28 09:30:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:24,109 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-28 09:30:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 09:30:24,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:24,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:24,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:24,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 09:30:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-04-28 09:30:24,114 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-04-28 09:30:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:24,115 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-04-28 09:30:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:24,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 143 transitions. [2022-04-28 09:30:24,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-28 09:30:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:30:24,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:24,273 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:24,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 09:30:24,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-04-28 09:30:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:24,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808656497] [2022-04-28 09:30:24,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 2 times [2022-04-28 09:30:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:24,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797873406] [2022-04-28 09:30:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:24,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#(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(9, 2); {2599#true} is VALID [2022-04-28 09:30:24,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 09:30:24,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-28 09:30:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:24,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-28 09:30:24,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-28 09:30:24,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 09:30:24,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:24,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {2599#true} call ULTIMATE.init(); {2613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:24,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(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(9, 2); {2599#true} is VALID [2022-04-28 09:30:24,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 09:30:24,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2599#true} {2599#true} #138#return; {2599#true} is VALID [2022-04-28 09:30:24,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {2599#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2599#true} is VALID [2022-04-28 09:30:24,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {2599#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2599#true} is VALID [2022-04-28 09:30:24,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {2599#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-28 09:30:24,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {2604#(<= (+ (* main_~l~0 2) main_~r~0) (+ 2 (* main_~n~0 2)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:30:24,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {2605#(<= (+ (* main_~l~0 2) main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:24,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume !(~j~0 <= ~r~0); {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:24,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} assume ~l~0 > 1; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:24,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {2599#true} is VALID [2022-04-28 09:30:24,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} ~cond := #in~cond; {2599#true} is VALID [2022-04-28 09:30:24,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} assume !(0 == ~cond); {2599#true} is VALID [2022-04-28 09:30:24,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} assume true; {2599#true} is VALID [2022-04-28 09:30:24,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2599#true} {2606#(<= (+ main_~l~0 1) main_~n~0)} #130#return; {2606#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:24,365 INFO L272 TraceCheckUtils]: 16: Hoare triple {2606#(<= (+ main_~l~0 1) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:24,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {2611#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:24,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2600#false} is VALID [2022-04-28 09:30:24,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {2600#false} assume !false; {2600#false} is VALID [2022-04-28 09:30:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797873406] [2022-04-28 09:30:24,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797873406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:24,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:24,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:24,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:24,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808656497] [2022-04-28 09:30:24,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808656497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:24,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:24,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:24,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855223414] [2022-04-28 09:30:24,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:24,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:24,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:24,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:24,380 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:25,554 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-04-28 09:30:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 09:30:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 09:30:25,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 09:30:25,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:25,651 INFO L225 Difference]: With dead ends: 131 [2022-04-28 09:30:25,652 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 09:30:25,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:25,652 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:25,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 59 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:30:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 09:30:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-04-28 09:30:25,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:25,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 09:30:25,913 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 09:30:25,913 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 09:30:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:25,918 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-28 09:30:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-28 09:30:25,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:25,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:25,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-28 09:30:25,919 INFO L87 Difference]: Start difference. First operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 129 states. [2022-04-28 09:30:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:25,923 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2022-04-28 09:30:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2022-04-28 09:30:25,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:25,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:25,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:25,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 09:30:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-04-28 09:30:25,928 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-04-28 09:30:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:25,929 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-04-28 09:30:25,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:25,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 189 transitions. [2022-04-28 09:30:26,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-04-28 09:30:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:30:26,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:26,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:26,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 09:30:26,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-04-28 09:30:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:26,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957384315] [2022-04-28 09:30:26,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 2 times [2022-04-28 09:30:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:26,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185879504] [2022-04-28 09:30:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:26,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {3413#(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(9, 2); {3400#true} is VALID [2022-04-28 09:30:26,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 09:30:26,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-28 09:30:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:26,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-28 09:30:26,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-28 09:30:26,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 09:30:26,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:26,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {3400#true} call ULTIMATE.init(); {3413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:26,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {3413#(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(9, 2); {3400#true} is VALID [2022-04-28 09:30:26,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 09:30:26,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3400#true} {3400#true} #138#return; {3400#true} is VALID [2022-04-28 09:30:26,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {3400#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3400#true} is VALID [2022-04-28 09:30:26,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {3400#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3400#true} is VALID [2022-04-28 09:30:26,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {3400#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:26,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:26,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {3405#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:26,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:26,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {3406#(<= main_~j~0 main_~n~0)} assume !(~j~0 < ~r~0); {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:26,189 INFO L272 TraceCheckUtils]: 11: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {3400#true} is VALID [2022-04-28 09:30:26,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#true} ~cond := #in~cond; {3400#true} is VALID [2022-04-28 09:30:26,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {3400#true} assume !(0 == ~cond); {3400#true} is VALID [2022-04-28 09:30:26,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {3400#true} assume true; {3400#true} is VALID [2022-04-28 09:30:26,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3400#true} {3406#(<= main_~j~0 main_~n~0)} #118#return; {3406#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:26,191 INFO L272 TraceCheckUtils]: 16: Hoare triple {3406#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:26,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {3411#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:26,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {3412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3401#false} is VALID [2022-04-28 09:30:26,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {3401#false} assume !false; {3401#false} is VALID [2022-04-28 09:30:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:26,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185879504] [2022-04-28 09:30:26,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185879504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:26,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:26,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:26,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:26,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957384315] [2022-04-28 09:30:26,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957384315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:26,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:26,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692271150] [2022-04-28 09:30:26,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:26,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:26,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:26,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:26,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:26,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:30:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:30:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:30:26,204 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:27,279 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-04-28 09:30:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:30:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 09:30:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 09:30:27,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-28 09:30:27,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:27,364 INFO L225 Difference]: With dead ends: 188 [2022-04-28 09:30:27,364 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 09:30:27,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:30:27,365 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:27,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 09:30:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-04-28 09:30:27,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:27,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-28 09:30:27,733 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-28 09:30:27,733 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-28 09:30:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:27,740 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-28 09:30:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-28 09:30:27,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:27,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:27,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-28 09:30:27,741 INFO L87 Difference]: Start difference. First operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) Second operand 186 states. [2022-04-28 09:30:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:27,748 INFO L93 Difference]: Finished difference Result 186 states and 289 transitions. [2022-04-28 09:30:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2022-04-28 09:30:27,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:27,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:27,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:27,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-28 09:30:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-04-28 09:30:27,754 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-04-28 09:30:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:27,755 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-04-28 09:30:27,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:27,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 252 transitions. [2022-04-28 09:30:28,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-04-28 09:30:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:30:28,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:28,031 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:28,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 09:30:28,032 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-04-28 09:30:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:28,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78910577] [2022-04-28 09:30:28,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 2 times [2022-04-28 09:30:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:28,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060201507] [2022-04-28 09:30:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:28,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {4508#(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(9, 2); {4498#true} is VALID [2022-04-28 09:30:28,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 09:30:28,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-28 09:30:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:28,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 09:30:28,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 09:30:28,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 09:30:28,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-28 09:30:28,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:28,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {4508#(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(9, 2); {4498#true} is VALID [2022-04-28 09:30:28,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 09:30:28,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4498#true} {4498#true} #138#return; {4498#true} is VALID [2022-04-28 09:30:28,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {4498#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {4498#true} is VALID [2022-04-28 09:30:28,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {4498#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4498#true} is VALID [2022-04-28 09:30:28,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {4498#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {4498#true} is VALID [2022-04-28 09:30:28,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {4498#true} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {4503#(<= main_~l~0 1)} is VALID [2022-04-28 09:30:28,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {4503#(<= main_~l~0 1)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {4503#(<= main_~l~0 1)} is VALID [2022-04-28 09:30:28,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(<= main_~l~0 1)} assume !(~j~0 <= ~r~0); {4503#(<= main_~l~0 1)} is VALID [2022-04-28 09:30:28,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {4503#(<= main_~l~0 1)} assume ~l~0 > 1; {4499#false} is VALID [2022-04-28 09:30:28,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {4499#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 09:30:28,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 09:30:28,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 09:30:28,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 09:30:28,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4499#false} #130#return; {4499#false} is VALID [2022-04-28 09:30:28,068 INFO L272 TraceCheckUtils]: 16: Hoare triple {4499#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {4499#false} is VALID [2022-04-28 09:30:28,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-28 09:30:28,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-28 09:30:28,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-28 09:30:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:28,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060201507] [2022-04-28 09:30:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060201507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:30:28,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:28,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78910577] [2022-04-28 09:30:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78910577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:30:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180701352] [2022-04-28 09:30:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:28,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:28,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:28,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:30:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:30:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:30:28,084 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:29,008 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-04-28 09:30:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:30:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 09:30:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 09:30:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 09:30:29,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-28 09:30:29,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:29,137 INFO L225 Difference]: With dead ends: 329 [2022-04-28 09:30:29,137 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 09:30:29,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-28 09:30:29,138 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:29,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 66 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:30:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 09:30:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-04-28 09:30:29,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:29,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:30:29,744 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:30:29,744 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:30:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:29,754 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-28 09:30:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-28 09:30:29,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:29,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:29,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-28 09:30:29,756 INFO L87 Difference]: Start difference. First operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) Second operand 239 states. [2022-04-28 09:30:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:29,766 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2022-04-28 09:30:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2022-04-28 09:30:29,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:29,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:29,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:29,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:30:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-04-28 09:30:29,776 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-04-28 09:30:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:29,776 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-04-28 09:30:29,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:29,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 336 transitions. [2022-04-28 09:30:30,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-04-28 09:30:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 09:30:30,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:30,165 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:30,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 09:30:30,165 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-04-28 09:30:30,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:30,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700839487] [2022-04-28 09:30:30,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 2 times [2022-04-28 09:30:30,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:30,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426503456] [2022-04-28 09:30:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:30,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {6084#(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(9, 2); {6067#true} is VALID [2022-04-28 09:30:30,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-28 09:30:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:30,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 09:30:30,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 09:30:30,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:30,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 09:30:30,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 09:30:30,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {6067#true} call ULTIMATE.init(); {6084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:30,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {6084#(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(9, 2); {6067#true} is VALID [2022-04-28 09:30:30,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #138#return; {6067#true} is VALID [2022-04-28 09:30:30,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {6067#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {6067#true} is VALID [2022-04-28 09:30:30,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6067#true} is VALID [2022-04-28 09:30:30,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {6067#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {6067#true} is VALID [2022-04-28 09:30:30,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {6072#(<= 1 main_~l~0)} is VALID [2022-04-28 09:30:30,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {6072#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {6073#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {6073#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,228 INFO L272 TraceCheckUtils]: 11: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {6067#true} is VALID [2022-04-28 09:30:30,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 09:30:30,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 09:30:30,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,228 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #118#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,229 INFO L272 TraceCheckUtils]: 16: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {6067#true} is VALID [2022-04-28 09:30:30,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-28 09:30:30,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-28 09:30:30,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-28 09:30:30,229 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6067#true} {6073#(<= 1 main_~i~0)} #120#return; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {6073#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {6073#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {6073#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:30,230 INFO L272 TraceCheckUtils]: 23: Hoare triple {6073#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:30,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {6082#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6083#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:30,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6068#false} is VALID [2022-04-28 09:30:30,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-28 09:30:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:30:30,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:30,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426503456] [2022-04-28 09:30:30,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426503456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:30,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:30,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:30,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:30,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700839487] [2022-04-28 09:30:30,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700839487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:30,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:30,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416557742] [2022-04-28 09:30:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 09:30:30,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:30,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:30,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:30,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:30:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:30:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:30:30,247 INFO L87 Difference]: Start difference. First operand 209 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:31,934 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-04-28 09:30:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 09:30:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 09:30:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 09:30:31,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-28 09:30:32,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:32,076 INFO L225 Difference]: With dead ends: 275 [2022-04-28 09:30:32,076 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 09:30:32,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:30:32,082 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:32,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:30:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 09:30:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-04-28 09:30:32,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:32,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:32,845 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:32,845 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:32,855 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-28 09:30:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-28 09:30:32,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:32,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:32,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-28 09:30:32,857 INFO L87 Difference]: Start difference. First operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 273 states. [2022-04-28 09:30:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:32,866 INFO L93 Difference]: Finished difference Result 273 states and 446 transitions. [2022-04-28 09:30:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 446 transitions. [2022-04-28 09:30:32,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:32,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:32,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-04-28 09:30:32,876 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-04-28 09:30:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:32,876 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-04-28 09:30:32,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:32,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 405 transitions. [2022-04-28 09:30:33,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-04-28 09:30:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:30:33,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:33,352 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:33,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 09:30:33,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-04-28 09:30:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:33,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131372580] [2022-04-28 09:30:33,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 2 times [2022-04-28 09:30:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:33,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028594079] [2022-04-28 09:30:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:33,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:33,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#(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(9, 2); {7694#true} is VALID [2022-04-28 09:30:33,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-28 09:30:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:33,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 09:30:33,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 09:30:33,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-28 09:30:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:33,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 09:30:33,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 09:30:33,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-28 09:30:33,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {7694#true} call ULTIMATE.init(); {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:33,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(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(9, 2); {7694#true} is VALID [2022-04-28 09:30:33,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7694#true} {7694#true} #138#return; {7694#true} is VALID [2022-04-28 09:30:33,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {7694#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7694#true} is VALID [2022-04-28 09:30:33,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {7694#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7694#true} is VALID [2022-04-28 09:30:33,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {7694#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} is VALID [2022-04-28 09:30:33,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {7699#(<= (* main_~l~0 2) (+ main_~r~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {7700#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {7700#(<= (* main_~l~0 2) main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7701#(<= main_~j~0 main_~r~0)} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {7701#(<= main_~j~0 main_~r~0)} assume !(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#false} assume ~l~0 > 1; {7695#false} is VALID [2022-04-28 09:30:33,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {7694#true} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 09:30:33,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7694#true} {7695#false} #130#return; {7695#false} is VALID [2022-04-28 09:30:33,407 INFO L272 TraceCheckUtils]: 16: Hoare triple {7695#false} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {7694#true} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#true} ~cond := #in~cond; {7694#true} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {7694#true} assume !(0 == ~cond); {7694#true} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {7694#true} assume true; {7694#true} is VALID [2022-04-28 09:30:33,407 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7694#true} {7695#false} #132#return; {7695#false} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {7695#false} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {7695#false} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {7695#false} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {7695#false} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {7695#false} assume !!(~j~0 <= ~r~0); {7695#false} is VALID [2022-04-28 09:30:33,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {7695#false} assume ~j~0 < ~r~0; {7695#false} is VALID [2022-04-28 09:30:33,408 INFO L272 TraceCheckUtils]: 25: Hoare triple {7695#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {7695#false} is VALID [2022-04-28 09:30:33,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {7695#false} ~cond := #in~cond; {7695#false} is VALID [2022-04-28 09:30:33,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {7695#false} assume 0 == ~cond; {7695#false} is VALID [2022-04-28 09:30:33,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {7695#false} assume !false; {7695#false} is VALID [2022-04-28 09:30:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:30:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028594079] [2022-04-28 09:30:33,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028594079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:33,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:33,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:33,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:33,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131372580] [2022-04-28 09:30:33,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131372580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:33,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:33,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594075443] [2022-04-28 09:30:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 09:30:33,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:33,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:33,423 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-28 09:30:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:30:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:30:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:30:33,424 INFO L87 Difference]: Start difference. First operand 249 states and 405 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:35,984 INFO L93 Difference]: Finished difference Result 593 states and 971 transitions. [2022-04-28 09:30:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:30:35,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 09:30:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-28 09:30:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-04-28 09:30:35,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-04-28 09:30:36,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:36,241 INFO L225 Difference]: With dead ends: 593 [2022-04-28 09:30:36,241 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 09:30:36,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:30:36,242 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:36,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:30:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 09:30:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 250. [2022-04-28 09:30:37,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:37,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:37,314 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:37,314 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:37,330 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-28 09:30:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-28 09:30:37,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:37,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:37,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-28 09:30:37,334 INFO L87 Difference]: Start difference. First operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) Second operand 396 states. [2022-04-28 09:30:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:37,355 INFO L93 Difference]: Finished difference Result 396 states and 653 transitions. [2022-04-28 09:30:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 653 transitions. [2022-04-28 09:30:37,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:37,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:37,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:37,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 115 states have (on average 1.373913043478261) internal successors, (158), 125 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-04-28 09:30:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 405 transitions. [2022-04-28 09:30:37,374 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 405 transitions. Word has length 29 [2022-04-28 09:30:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:37,374 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 405 transitions. [2022-04-28 09:30:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 09:30:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 405 transitions. [2022-04-28 09:30:37,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 405 transitions. [2022-04-28 09:30:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:30:37,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:37,907 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:37,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 09:30:37,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-04-28 09:30:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:37,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720940496] [2022-04-28 09:30:37,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 2 times [2022-04-28 09:30:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:37,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127261068] [2022-04-28 09:30:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:37,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {10222#(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(9, 2); {10201#true} is VALID [2022-04-28 09:30:37,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-28 09:30:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:37,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:37,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:30:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:37,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {10201#true} call ULTIMATE.init(); {10222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:37,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {10222#(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(9, 2); {10201#true} is VALID [2022-04-28 09:30:37,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10201#true} {10201#true} #138#return; {10201#true} is VALID [2022-04-28 09:30:37,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {10201#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {10201#true} is VALID [2022-04-28 09:30:37,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {10201#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10201#true} is VALID [2022-04-28 09:30:37,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {10201#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:37,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:37,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:37,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {10206#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:37,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {10206#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,995 INFO L272 TraceCheckUtils]: 11: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-28 09:30:37,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,995 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,995 INFO L272 TraceCheckUtils]: 16: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {10201#true} is VALID [2022-04-28 09:30:37,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,996 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,996 INFO L272 TraceCheckUtils]: 21: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {10201#true} is VALID [2022-04-28 09:30:37,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {10201#true} ~cond := #in~cond; {10201#true} is VALID [2022-04-28 09:30:37,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {10201#true} assume !(0 == ~cond); {10201#true} is VALID [2022-04-28 09:30:37,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {10201#true} assume true; {10201#true} is VALID [2022-04-28 09:30:37,997 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10201#true} {10207#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {10207#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:37,997 INFO L272 TraceCheckUtils]: 26: Hoare triple {10207#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:37,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {10220#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10221#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:37,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {10221#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10202#false} is VALID [2022-04-28 09:30:37,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {10202#false} assume !false; {10202#false} is VALID [2022-04-28 09:30:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:30:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:37,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127261068] [2022-04-28 09:30:37,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127261068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:37,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:37,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:37,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:37,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720940496] [2022-04-28 09:30:37,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720940496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:37,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:37,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:30:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944507896] [2022-04-28 09:30:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 09:30:38,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:38,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:38,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:30:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:38,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:30:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:30:38,014 INFO L87 Difference]: Start difference. First operand 250 states and 405 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:39,769 INFO L93 Difference]: Finished difference Result 324 states and 521 transitions. [2022-04-28 09:30:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:30:39,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 09:30:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 09:30:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-28 09:30:39,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-28 09:30:39,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:39,848 INFO L225 Difference]: With dead ends: 324 [2022-04-28 09:30:39,848 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 09:30:39,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:30:39,849 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:39,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:30:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 09:30:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 300. [2022-04-28 09:30:40,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:40,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 09:30:40,853 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 09:30:40,853 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 09:30:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:40,865 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-28 09:30:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-28 09:30:40,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:40,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:40,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-28 09:30:40,869 INFO L87 Difference]: Start difference. First operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) Second operand 322 states. [2022-04-28 09:30:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:40,878 INFO L93 Difference]: Finished difference Result 322 states and 519 transitions. [2022-04-28 09:30:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 519 transitions. [2022-04-28 09:30:40,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:40,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:40,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:40,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 133 states have (on average 1.368421052631579) internal successors, (182), 149 states have internal predecessors, (182), 154 states have call successors, (154), 13 states have call predecessors, (154), 12 states have return successors, (153), 137 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 09:30:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2022-04-28 09:30:40,890 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 30 [2022-04-28 09:30:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:40,890 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2022-04-28 09:30:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:40,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 489 transitions. [2022-04-28 09:30:41,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2022-04-28 09:30:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:30:41,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:41,514 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:41,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 09:30:41,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 1 times [2022-04-28 09:30:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:41,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156979153] [2022-04-28 09:30:41,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1828949766, now seen corresponding path program 2 times [2022-04-28 09:30:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:41,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738646056] [2022-04-28 09:30:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:41,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {12150#(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(9, 2); {12128#true} is VALID [2022-04-28 09:30:41,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-28 09:30:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:41,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:41,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 09:30:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:41,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {12128#true} call ULTIMATE.init(); {12150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:41,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {12150#(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(9, 2); {12128#true} is VALID [2022-04-28 09:30:41,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12128#true} {12128#true} #138#return; {12128#true} is VALID [2022-04-28 09:30:41,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {12128#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {12128#true} is VALID [2022-04-28 09:30:41,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {12128#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12128#true} is VALID [2022-04-28 09:30:41,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {12128#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} is VALID [2022-04-28 09:30:41,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {12133#(<= (* main_~l~0 2) (+ main_~n~0 2))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {12134#(<= (+ main_~l~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {12134#(<= (+ main_~l~0 1) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !!(~j~0 <= ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(~j~0 < ~r~0); {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {12128#true} is VALID [2022-04-28 09:30:41,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,582 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #118#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,582 INFO L272 TraceCheckUtils]: 16: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {12128#true} is VALID [2022-04-28 09:30:41,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,583 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #120#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,584 INFO L272 TraceCheckUtils]: 23: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {12128#true} is VALID [2022-04-28 09:30:41,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {12128#true} ~cond := #in~cond; {12128#true} is VALID [2022-04-28 09:30:41,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {12128#true} assume !(0 == ~cond); {12128#true} is VALID [2022-04-28 09:30:41,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {12128#true} assume true; {12128#true} is VALID [2022-04-28 09:30:41,585 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12128#true} {12135#(<= (+ main_~i~0 1) main_~n~0)} #122#return; {12135#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-28 09:30:41,585 INFO L272 TraceCheckUtils]: 28: Hoare triple {12135#(<= (+ main_~i~0 1) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:41,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {12148#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12149#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:41,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {12149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12129#false} is VALID [2022-04-28 09:30:41,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {12129#false} assume !false; {12129#false} is VALID [2022-04-28 09:30:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:30:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738646056] [2022-04-28 09:30:41,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738646056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:41,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:41,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:41,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:41,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156979153] [2022-04-28 09:30:41,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156979153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:41,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:41,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687569925] [2022-04-28 09:30:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 09:30:41,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:41,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:41,601 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-28 09:30:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:41,602 INFO L87 Difference]: Start difference. First operand 300 states and 489 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:43,974 INFO L93 Difference]: Finished difference Result 470 states and 788 transitions. [2022-04-28 09:30:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 09:30:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-28 09:30:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-04-28 09:30:43,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 145 transitions. [2022-04-28 09:30:44,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:44,098 INFO L225 Difference]: With dead ends: 470 [2022-04-28 09:30:44,099 INFO L226 Difference]: Without dead ends: 468 [2022-04-28 09:30:44,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:44,105 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:44,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 77 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:30:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-28 09:30:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 422. [2022-04-28 09:30:45,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:45,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-28 09:30:45,357 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-28 09:30:45,359 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-28 09:30:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:45,393 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-28 09:30:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-28 09:30:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:45,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:45,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-28 09:30:45,399 INFO L87 Difference]: Start difference. First operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) Second operand 468 states. [2022-04-28 09:30:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:45,417 INFO L93 Difference]: Finished difference Result 468 states and 786 transitions. [2022-04-28 09:30:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 786 transitions. [2022-04-28 09:30:45,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:45,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:45,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:45,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 206 states have internal predecessors, (251), 229 states have call successors, (229), 14 states have call predecessors, (229), 13 states have return successors, (228), 201 states have call predecessors, (228), 228 states have call successors, (228) [2022-04-28 09:30:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 708 transitions. [2022-04-28 09:30:45,437 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 708 transitions. Word has length 32 [2022-04-28 09:30:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:45,437 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 708 transitions. [2022-04-28 09:30:45,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:45,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 422 states and 708 transitions. [2022-04-28 09:30:46,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 708 edges. 708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 708 transitions. [2022-04-28 09:30:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:30:46,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:46,435 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 09:30:46,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 1 times [2022-04-28 09:30:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219793042] [2022-04-28 09:30:46,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1969498376, now seen corresponding path program 2 times [2022-04-28 09:30:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:46,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084902617] [2022-04-28 09:30:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:46,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {14907#(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(9, 2); {14885#true} is VALID [2022-04-28 09:30:46,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-28 09:30:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:46,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:46,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 09:30:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:46,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {14885#true} call ULTIMATE.init(); {14907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:46,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {14907#(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(9, 2); {14885#true} is VALID [2022-04-28 09:30:46,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14885#true} {14885#true} #138#return; {14885#true} is VALID [2022-04-28 09:30:46,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {14885#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {14885#true} is VALID [2022-04-28 09:30:46,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {14885#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {14885#true} is VALID [2022-04-28 09:30:46,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {14885#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {14890#(<= 1 main_~n~0)} is VALID [2022-04-28 09:30:46,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {14890#(<= 1 main_~n~0)} assume !(~l~0 > 1);#t~post3 := ~r~0;~r~0 := #t~post3 - 1;havoc #t~post3; {14891#(<= main_~l~0 main_~n~0)} is VALID [2022-04-28 09:30:46,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(<= main_~l~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,554 INFO L272 TraceCheckUtils]: 11: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {14885#true} is VALID [2022-04-28 09:30:46,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,556 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #118#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,556 INFO L272 TraceCheckUtils]: 16: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {14885#true} is VALID [2022-04-28 09:30:46,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,560 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #120#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {14892#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,561 INFO L272 TraceCheckUtils]: 23: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {14885#true} is VALID [2022-04-28 09:30:46,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {14885#true} ~cond := #in~cond; {14885#true} is VALID [2022-04-28 09:30:46,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {14885#true} assume !(0 == ~cond); {14885#true} is VALID [2022-04-28 09:30:46,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {14885#true} assume true; {14885#true} is VALID [2022-04-28 09:30:46,561 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14885#true} {14892#(<= main_~i~0 main_~n~0)} #122#return; {14892#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:30:46,562 INFO L272 TraceCheckUtils]: 28: Hoare triple {14892#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:46,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {14905#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14906#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:46,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {14906#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14886#false} is VALID [2022-04-28 09:30:46,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {14886#false} assume !false; {14886#false} is VALID [2022-04-28 09:30:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:30:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:46,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084902617] [2022-04-28 09:30:46,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084902617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:46,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:46,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:46,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:46,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219793042] [2022-04-28 09:30:46,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219793042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:46,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:46,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902018334] [2022-04-28 09:30:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:46,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 09:30:46,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:46,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:46,577 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-28 09:30:46,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:46,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:46,578 INFO L87 Difference]: Start difference. First operand 422 states and 708 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:50,043 INFO L93 Difference]: Finished difference Result 489 states and 817 transitions. [2022-04-28 09:30:50,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:30:50,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 09:30:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 09:30:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-28 09:30:50,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-28 09:30:50,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:50,156 INFO L225 Difference]: With dead ends: 489 [2022-04-28 09:30:50,157 INFO L226 Difference]: Without dead ends: 487 [2022-04-28 09:30:50,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:30:50,158 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 109 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:50,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:30:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-28 09:30:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 429. [2022-04-28 09:30:51,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:51,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:51,968 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:51,968 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:51,988 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-28 09:30:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-28 09:30:51,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:51,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:51,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-28 09:30:51,992 INFO L87 Difference]: Start difference. First operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 487 states. [2022-04-28 09:30:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:52,011 INFO L93 Difference]: Finished difference Result 487 states and 815 transitions. [2022-04-28 09:30:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 815 transitions. [2022-04-28 09:30:52,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:52,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:52,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:52,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 209 states have internal predecessors, (254), 232 states have call successors, (232), 15 states have call predecessors, (232), 14 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 717 transitions. [2022-04-28 09:30:52,031 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 717 transitions. Word has length 32 [2022-04-28 09:30:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:52,031 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 717 transitions. [2022-04-28 09:30:52,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 09:30:52,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 429 states and 717 transitions. [2022-04-28 09:30:53,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 717 transitions. [2022-04-28 09:30:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:30:53,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:53,151 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:53,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 09:30:53,151 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-04-28 09:30:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698245929] [2022-04-28 09:30:53,152 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 2 times [2022-04-28 09:30:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219983181] [2022-04-28 09:30:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {17760#(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(9, 2); {17730#true} is VALID [2022-04-28 09:30:53,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-28 09:30:53,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:30:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:30:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:30:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:53,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {17730#true} call ULTIMATE.init(); {17760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:53,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {17760#(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(9, 2); {17730#true} is VALID [2022-04-28 09:30:53,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17730#true} {17730#true} #138#return; {17730#true} is VALID [2022-04-28 09:30:53,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {17730#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {17730#true} is VALID [2022-04-28 09:30:53,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {17730#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {17730#true} is VALID [2022-04-28 09:30:53,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {17730#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:53,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:53,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:53,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {17735#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:30:53,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {17735#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,269 INFO L272 TraceCheckUtils]: 11: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-28 09:30:53,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #110#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,270 INFO L272 TraceCheckUtils]: 16: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #112#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,271 INFO L272 TraceCheckUtils]: 21: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #114#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,271 INFO L272 TraceCheckUtils]: 26: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,272 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17730#true} {17736#(<= (+ main_~j~0 1) main_~n~0)} #116#return; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17736#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 09:30:53,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {17736#(<= (+ main_~j~0 1) main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:53,273 INFO L272 TraceCheckUtils]: 33: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {17730#true} is VALID [2022-04-28 09:30:53,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {17730#true} ~cond := #in~cond; {17730#true} is VALID [2022-04-28 09:30:53,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {17730#true} assume !(0 == ~cond); {17730#true} is VALID [2022-04-28 09:30:53,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {17730#true} assume true; {17730#true} is VALID [2022-04-28 09:30:53,273 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17730#true} {17753#(<= main_~j~0 main_~n~0)} #118#return; {17753#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:30:53,274 INFO L272 TraceCheckUtils]: 38: Hoare triple {17753#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:53,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {17758#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17759#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:53,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {17759#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17731#false} is VALID [2022-04-28 09:30:53,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {17731#false} assume !false; {17731#false} is VALID [2022-04-28 09:30:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:30:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219983181] [2022-04-28 09:30:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219983181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:53,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:53,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:53,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698245929] [2022-04-28 09:30:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698245929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:53,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:53,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466109808] [2022-04-28 09:30:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-28 09:30:53,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:53,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 09:30:53,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:53,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:53,294 INFO L87 Difference]: Start difference. First operand 429 states and 717 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 09:30:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:56,407 INFO L93 Difference]: Finished difference Result 484 states and 791 transitions. [2022-04-28 09:30:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-28 09:30:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 09:30:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 09:30:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 09:30:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 09:30:56,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-28 09:30:56,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:56,504 INFO L225 Difference]: With dead ends: 484 [2022-04-28 09:30:56,504 INFO L226 Difference]: Without dead ends: 482 [2022-04-28 09:30:56,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:56,505 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:56,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 82 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:30:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-28 09:30:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 433. [2022-04-28 09:30:58,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:58,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:58,076 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:58,077 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:58,106 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-28 09:30:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-28 09:30:58,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:58,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:58,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-28 09:30:58,109 INFO L87 Difference]: Start difference. First operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 482 states. [2022-04-28 09:30:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:58,140 INFO L93 Difference]: Finished difference Result 482 states and 789 transitions. [2022-04-28 09:30:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 789 transitions. [2022-04-28 09:30:58,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:58,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:58,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:58,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 212 states have internal predecessors, (257), 232 states have call successors, (232), 16 states have call predecessors, (232), 15 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:30:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 720 transitions. [2022-04-28 09:30:58,173 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 720 transitions. Word has length 42 [2022-04-28 09:30:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:58,173 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 720 transitions. [2022-04-28 09:30:58,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 09:30:58,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 720 transitions. [2022-04-28 09:30:59,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 720 transitions. [2022-04-28 09:30:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:30:59,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:59,065 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:59,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 09:30:59,065 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 1 times [2022-04-28 09:30:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735632082] [2022-04-28 09:30:59,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -756625364, now seen corresponding path program 2 times [2022-04-28 09:30:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543167850] [2022-04-28 09:30:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {20600#(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(9, 2); {20574#true} is VALID [2022-04-28 09:30:59,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-28 09:30:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:30:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-28 09:30:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:30:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-28 09:30:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:30:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 09:30:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:30:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:59,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 09:30:59,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {20574#true} call ULTIMATE.init(); {20600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:59,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {20600#(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(9, 2); {20574#true} is VALID [2022-04-28 09:30:59,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20574#true} {20574#true} #138#return; {20574#true} is VALID [2022-04-28 09:30:59,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {20574#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {20574#true} is VALID [2022-04-28 09:30:59,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {20574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {20574#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {20574#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {20574#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {20574#true} assume !!(~j~0 <= ~r~0); {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {20574#true} assume !(~j~0 < ~r~0); {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {20574#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20574#true} {20574#true} #118#return; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L272 TraceCheckUtils]: 16: Hoare triple {20574#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,163 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20574#true} {20574#true} #120#return; {20574#true} is VALID [2022-04-28 09:30:59,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {20574#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20574#true} is VALID [2022-04-28 09:30:59,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {20574#true} assume 0 != #t~nondet5;havoc #t~nondet5; {20574#true} is VALID [2022-04-28 09:30:59,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {20574#true} assume ~l~0 > 1; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 09:30:59,169 INFO L272 TraceCheckUtils]: 24: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {20574#true} is VALID [2022-04-28 09:30:59,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,170 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #130#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 09:30:59,170 INFO L272 TraceCheckUtils]: 29: Hoare triple {20587#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {20574#true} is VALID [2022-04-28 09:30:59,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {20574#true} ~cond := #in~cond; {20574#true} is VALID [2022-04-28 09:30:59,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {20574#true} assume !(0 == ~cond); {20574#true} is VALID [2022-04-28 09:30:59,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {20574#true} assume true; {20574#true} is VALID [2022-04-28 09:30:59,172 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20574#true} {20587#(<= 2 main_~l~0)} #132#return; {20587#(<= 2 main_~l~0)} is VALID [2022-04-28 09:30:59,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {20587#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {20596#(<= 1 main_~l~0)} is VALID [2022-04-28 09:30:59,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {20596#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:59,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {20597#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {20597#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:59,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {20597#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {20597#(<= 2 main_~j~0)} is VALID [2022-04-28 09:30:59,174 INFO L272 TraceCheckUtils]: 38: Hoare triple {20597#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:59,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {20598#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:59,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {20599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20575#false} is VALID [2022-04-28 09:30:59,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {20575#false} assume !false; {20575#false} is VALID [2022-04-28 09:30:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:30:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:59,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543167850] [2022-04-28 09:30:59,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543167850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:59,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:59,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:59,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735632082] [2022-04-28 09:30:59,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735632082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:59,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187267027] [2022-04-28 09:30:59,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:59,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-28 09:30:59,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:59,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:30:59,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:59,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:59,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:59,193 INFO L87 Difference]: Start difference. First operand 433 states and 720 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:31:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:02,209 INFO L93 Difference]: Finished difference Result 440 states and 726 transitions. [2022-04-28 09:31:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:31:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-28 09:31:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:31:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 09:31:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:31:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 09:31:02,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-28 09:31:02,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:02,285 INFO L225 Difference]: With dead ends: 440 [2022-04-28 09:31:02,285 INFO L226 Difference]: Without dead ends: 438 [2022-04-28 09:31:02,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:31:02,286 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:02,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:31:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-28 09:31:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2022-04-28 09:31:04,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:04,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:04,771 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:04,771 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:04,788 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-28 09:31:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-28 09:31:04,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:04,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:04,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-28 09:31:04,791 INFO L87 Difference]: Start difference. First operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 438 states. [2022-04-28 09:31:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:04,807 INFO L93 Difference]: Finished difference Result 438 states and 724 transitions. [2022-04-28 09:31:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 724 transitions. [2022-04-28 09:31:04,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:04,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:04,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:04,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 215 states have internal predecessors, (260), 232 states have call successors, (232), 17 states have call predecessors, (232), 16 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 723 transitions. [2022-04-28 09:31:04,826 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 723 transitions. Word has length 42 [2022-04-28 09:31:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:04,827 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 723 transitions. [2022-04-28 09:31:04,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 09:31:04,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 723 transitions. [2022-04-28 09:31:05,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 723 transitions. [2022-04-28 09:31:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 09:31:05,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:05,840 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:05,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 09:31:05,841 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 1 times [2022-04-28 09:31:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:05,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168484252] [2022-04-28 09:31:05,841 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 202086614, now seen corresponding path program 2 times [2022-04-28 09:31:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908739411] [2022-04-28 09:31:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {23282#(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(9, 2); {23248#true} is VALID [2022-04-28 09:31:05,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-28 09:31:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-28 09:31:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-28 09:31:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:31:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:31:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:31:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:05,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {23248#true} call ULTIMATE.init(); {23282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {23282#(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(9, 2); {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23248#true} {23248#true} #138#return; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {23248#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {23248#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {23248#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {23248#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {23248#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {23248#true} assume !!(~j~0 <= ~r~0); {23248#true} is VALID [2022-04-28 09:31:05,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {23248#true} assume !(~j~0 < ~r~0); {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L272 TraceCheckUtils]: 11: Hoare triple {23248#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23248#true} {23248#true} #118#return; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L272 TraceCheckUtils]: 16: Hoare triple {23248#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23248#true} {23248#true} #120#return; {23248#true} is VALID [2022-04-28 09:31:05,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {23248#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23248#true} is VALID [2022-04-28 09:31:05,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {23248#true} assume 0 != #t~nondet5;havoc #t~nondet5; {23248#true} is VALID [2022-04-28 09:31:05,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {23248#true} assume ~l~0 > 1; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:05,927 INFO L272 TraceCheckUtils]: 24: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,928 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #130#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:05,928 INFO L272 TraceCheckUtils]: 29: Hoare triple {23261#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,929 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {23248#true} {23261#(<= 2 main_~l~0)} #132#return; {23261#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:05,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {23261#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {23270#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:05,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {23270#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {23271#(<= 1 main_~i~0)} assume !!(~j~0 <= ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {23271#(<= 1 main_~i~0)} assume !(~j~0 < ~r~0); {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,937 INFO L272 TraceCheckUtils]: 38: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,938 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #118#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,938 INFO L272 TraceCheckUtils]: 43: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {23248#true} is VALID [2022-04-28 09:31:05,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {23248#true} ~cond := #in~cond; {23248#true} is VALID [2022-04-28 09:31:05,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {23248#true} assume !(0 == ~cond); {23248#true} is VALID [2022-04-28 09:31:05,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {23248#true} assume true; {23248#true} is VALID [2022-04-28 09:31:05,938 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23248#true} {23271#(<= 1 main_~i~0)} #120#return; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {23271#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {23271#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {23271#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:05,939 INFO L272 TraceCheckUtils]: 50: Hoare triple {23271#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:05,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {23280#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23281#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:05,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {23281#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23249#false} is VALID [2022-04-28 09:31:05,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#false} assume !false; {23249#false} is VALID [2022-04-28 09:31:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 09:31:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908739411] [2022-04-28 09:31:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908739411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:05,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:05,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:31:05,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:05,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168484252] [2022-04-28 09:31:05,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168484252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:05,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:05,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:31:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165510116] [2022-04-28 09:31:05,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-28 09:31:05,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:05,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 09:31:05,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:05,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:31:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:31:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:31:05,976 INFO L87 Difference]: Start difference. First operand 437 states and 723 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 09:31:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:08,886 INFO L93 Difference]: Finished difference Result 501 states and 826 transitions. [2022-04-28 09:31:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:31:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2022-04-28 09:31:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 09:31:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-28 09:31:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 09:31:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-28 09:31:08,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-28 09:31:08,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:08,986 INFO L225 Difference]: With dead ends: 501 [2022-04-28 09:31:08,986 INFO L226 Difference]: Without dead ends: 499 [2022-04-28 09:31:08,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:31:08,999 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:08,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 66 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:31:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-28 09:31:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2022-04-28 09:31:10,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:10,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:10,839 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:10,840 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:10,859 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 09:31:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 09:31:10,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:10,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:10,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-28 09:31:10,862 INFO L87 Difference]: Start difference. First operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) Second operand 499 states. [2022-04-28 09:31:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:10,878 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-28 09:31:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-28 09:31:10,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:10,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:10,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:10,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 218 states have internal predecessors, (263), 232 states have call successors, (232), 18 states have call predecessors, (232), 17 states have return successors, (231), 204 states have call predecessors, (231), 231 states have call successors, (231) [2022-04-28 09:31:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 726 transitions. [2022-04-28 09:31:10,895 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 726 transitions. Word has length 54 [2022-04-28 09:31:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:10,896 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 726 transitions. [2022-04-28 09:31:10,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 09:31:10,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 441 states and 726 transitions. [2022-04-28 09:31:11,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 726 transitions. [2022-04-28 09:31:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 09:31:11,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:11,773 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:11,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 09:31:11,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2022-04-28 09:31:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617678326] [2022-04-28 09:31:12,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:31:12,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 2 times [2022-04-28 09:31:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659189502] [2022-04-28 09:31:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {26226#(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(9, 2); {26184#true} is VALID [2022-04-28 09:31:12,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 09:31:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 09:31:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:31:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:31:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:31:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 09:31:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:12,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {26226#(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(9, 2); {26184#true} is VALID [2022-04-28 09:31:12,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 09:31:12,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {26184#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {26184#true} is VALID [2022-04-28 09:31:12,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {26184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26184#true} is VALID [2022-04-28 09:31:12,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {26184#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {26184#true} is VALID [2022-04-28 09:31:12,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {26184#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {26189#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:12,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {26189#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {26190#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {26190#(<= 2 main_~j~0)} assume !(~j~0 < ~r~0); {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,226 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #118#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,226 INFO L272 TraceCheckUtils]: 16: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,227 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #120#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {26190#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {26190#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,227 INFO L272 TraceCheckUtils]: 23: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,228 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #122#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,229 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #124#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,229 INFO L272 TraceCheckUtils]: 33: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,229 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #126#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,230 INFO L272 TraceCheckUtils]: 38: Hoare triple {26190#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,230 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26190#(<= 2 main_~j~0)} #128#return; {26190#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:12,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {26190#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {26215#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {26215#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,231 INFO L272 TraceCheckUtils]: 46: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,233 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #118#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,233 INFO L272 TraceCheckUtils]: 51: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:12,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:12,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:12,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:12,233 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26184#true} {26215#(<= 2 main_~i~0)} #120#return; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {26215#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {26215#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {26215#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:12,234 INFO L272 TraceCheckUtils]: 58: Hoare triple {26215#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26224#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:12,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {26224#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26225#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:12,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {26225#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26185#false} is VALID [2022-04-28 09:31:12,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-28 09:31:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 09:31:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659189502] [2022-04-28 09:31:12,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659189502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889229367] [2022-04-28 09:31:12,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:31:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:12,252 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-28 09:31:12,267 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-28 09:31:12,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:31:12,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:12,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:31:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:12,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:31:13,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {26184#true} call ULTIMATE.init(); {26184#true} is VALID [2022-04-28 09:31:13,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {26184#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(9, 2); {26184#true} is VALID [2022-04-28 09:31:13,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26184#true} {26184#true} #138#return; {26184#true} is VALID [2022-04-28 09:31:13,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {26184#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {26184#true} is VALID [2022-04-28 09:31:13,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {26184#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26184#true} is VALID [2022-04-28 09:31:13,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {26184#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {26248#(<= 1 main_~r~0)} is VALID [2022-04-28 09:31:13,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {26248#(<= 1 main_~r~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {26248#(<= 1 main_~r~0)} is VALID [2022-04-28 09:31:13,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {26248#(<= 1 main_~r~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {26248#(<= 1 main_~r~0)} is VALID [2022-04-28 09:31:13,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {26248#(<= 1 main_~r~0)} assume !!(~j~0 <= ~r~0); {26248#(<= 1 main_~r~0)} is VALID [2022-04-28 09:31:13,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {26248#(<= 1 main_~r~0)} assume !(~j~0 < ~r~0); {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #118#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,053 INFO L272 TraceCheckUtils]: 16: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,053 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #120#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,054 INFO L272 TraceCheckUtils]: 23: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,054 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #122#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,055 INFO L272 TraceCheckUtils]: 28: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #124#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,055 INFO L272 TraceCheckUtils]: 33: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,056 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #126#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,056 INFO L272 TraceCheckUtils]: 38: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26184#true} is VALID [2022-04-28 09:31:13,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {26184#true} ~cond := #in~cond; {26184#true} is VALID [2022-04-28 09:31:13,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {26184#true} assume !(0 == ~cond); {26184#true} is VALID [2022-04-28 09:31:13,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {26184#true} assume true; {26184#true} is VALID [2022-04-28 09:31:13,056 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26184#true} {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} #128#return; {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:31:13,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {26261#(and (<= 1 main_~r~0) (not (< main_~j~0 main_~r~0)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {26361#(and (<= main_~r~0 (div main_~j~0 2)) (<= 1 main_~r~0))} is VALID [2022-04-28 09:31:13,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {26361#(and (<= main_~r~0 (div main_~j~0 2)) (<= 1 main_~r~0))} assume !!(~j~0 <= ~r~0); {26185#false} is VALID [2022-04-28 09:31:13,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {26185#false} assume !(~j~0 < ~r~0); {26185#false} is VALID [2022-04-28 09:31:13,057 INFO L272 TraceCheckUtils]: 46: Hoare triple {26185#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26185#false} {26185#false} #118#return; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L272 TraceCheckUtils]: 51: Hoare triple {26185#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {26185#false} assume !(0 == ~cond); {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {26185#false} assume true; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26185#false} {26185#false} #120#return; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {26185#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {26185#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L272 TraceCheckUtils]: 58: Hoare triple {26185#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {26185#false} ~cond := #in~cond; {26185#false} is VALID [2022-04-28 09:31:13,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {26185#false} assume 0 == ~cond; {26185#false} is VALID [2022-04-28 09:31:13,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {26185#false} assume !false; {26185#false} is VALID [2022-04-28 09:31:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-28 09:31:13,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:31:13,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889229367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:13,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:31:13,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-28 09:31:13,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:13,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617678326] [2022-04-28 09:31:13,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617678326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:13,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:13,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:31:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883430004] [2022-04-28 09:31:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 09:31:13,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:13,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 09:31:13,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:13,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:31:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:31:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:31:13,086 INFO L87 Difference]: Start difference. First operand 441 states and 726 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 09:31:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:15,871 INFO L93 Difference]: Finished difference Result 843 states and 1374 transitions. [2022-04-28 09:31:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:31:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 09:31:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 09:31:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-28 09:31:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 09:31:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2022-04-28 09:31:15,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 152 transitions. [2022-04-28 09:31:15,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:15,992 INFO L225 Difference]: With dead ends: 843 [2022-04-28 09:31:15,992 INFO L226 Difference]: Without dead ends: 437 [2022-04-28 09:31:15,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:31:15,993 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:15,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 109 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:31:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-04-28 09:31:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 401. [2022-04-28 09:31:18,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:18,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-28 09:31:18,396 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-28 09:31:18,397 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-28 09:31:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:18,409 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-28 09:31:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-28 09:31:18,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:18,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:18,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) Second operand 437 states. [2022-04-28 09:31:18,411 INFO L87 Difference]: Start difference. First operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) Second operand 437 states. [2022-04-28 09:31:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:18,423 INFO L93 Difference]: Finished difference Result 437 states and 700 transitions. [2022-04-28 09:31:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 700 transitions. [2022-04-28 09:31:18,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:18,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:18,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:18,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 183 states have (on average 1.3387978142076502) internal successors, (245), 203 states have internal predecessors, (245), 200 states have call successors, (200), 18 states have call predecessors, (200), 17 states have return successors, (199), 179 states have call predecessors, (199), 199 states have call successors, (199) [2022-04-28 09:31:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 644 transitions. [2022-04-28 09:31:18,437 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 644 transitions. Word has length 62 [2022-04-28 09:31:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:18,437 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 644 transitions. [2022-04-28 09:31:18,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 09:31:18,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 644 transitions. [2022-04-28 09:31:19,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 644 transitions. [2022-04-28 09:31:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 09:31:19,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:19,354 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:19,373 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-28 09:31:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:31:19,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-04-28 09:31:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:19,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991533403] [2022-04-28 09:31:20,028 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:31:20,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 2 times [2022-04-28 09:31:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:20,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162063041] [2022-04-28 09:31:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {29836#(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(9, 2); {29777#true} is VALID [2022-04-28 09:31:20,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 09:31:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:31:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:31:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:31:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 09:31:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:31:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-28 09:31:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:31:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:31:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-28 09:31:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:20,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {29836#(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(9, 2); {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {29777#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {29777#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29777#true} is VALID [2022-04-28 09:31:20,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {29777#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {29777#true} is VALID [2022-04-28 09:31:20,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {29777#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {29782#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:20,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {29782#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {29783#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {29783#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #110#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,233 INFO L272 TraceCheckUtils]: 16: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #112#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,233 INFO L272 TraceCheckUtils]: 21: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #114#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,234 INFO L272 TraceCheckUtils]: 26: Hoare triple {29783#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,234 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29783#(<= 2 main_~j~0)} #116#return; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {29783#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {29783#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:20,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {29783#(<= 2 main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,235 INFO L272 TraceCheckUtils]: 33: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,236 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #118#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,236 INFO L272 TraceCheckUtils]: 38: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,236 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #120#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {29800#(<= 3 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {29800#(<= 3 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,237 INFO L272 TraceCheckUtils]: 45: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,238 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #122#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,238 INFO L272 TraceCheckUtils]: 50: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,238 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #124#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,238 INFO L272 TraceCheckUtils]: 55: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #126#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,239 INFO L272 TraceCheckUtils]: 60: Hoare triple {29800#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,240 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29800#(<= 3 main_~j~0)} #128#return; {29800#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:20,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {29800#(<= 3 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {29825#(<= 3 main_~i~0)} assume !!(~j~0 <= ~r~0); {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {29825#(<= 3 main_~i~0)} assume !(~j~0 < ~r~0); {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,241 INFO L272 TraceCheckUtils]: 68: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #118#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,241 INFO L272 TraceCheckUtils]: 73: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:20,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:20,242 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29777#true} {29825#(<= 3 main_~i~0)} #120#return; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {29825#(<= 3 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,242 INFO L290 TraceCheckUtils]: 79: Hoare triple {29825#(<= 3 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {29825#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:20,243 INFO L272 TraceCheckUtils]: 80: Hoare triple {29825#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29834#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:20,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {29834#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29835#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:20,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {29835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29778#false} is VALID [2022-04-28 09:31:20,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-28 09:31:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 09:31:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:20,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162063041] [2022-04-28 09:31:20,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162063041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:20,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152738797] [2022-04-28 09:31:20,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:31:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:20,246 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-28 09:31:20,247 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-28 09:31:20,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:31:20,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:20,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:31:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:20,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:31:23,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {29777#true} call ULTIMATE.init(); {29777#true} is VALID [2022-04-28 09:31:23,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {29777#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(9, 2); {29777#true} is VALID [2022-04-28 09:31:23,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29777#true} {29777#true} #138#return; {29777#true} is VALID [2022-04-28 09:31:23,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {29777#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {29777#true} is VALID [2022-04-28 09:31:23,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {29777#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29777#true} is VALID [2022-04-28 09:31:23,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {29777#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {29858#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-28 09:31:23,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {29858#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {29862#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-28 09:31:23,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {29862#(and (< 0 (+ main_~l~0 1)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume !!(~j~0 <= ~r~0); {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume ~j~0 < ~r~0; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #110#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,223 INFO L272 TraceCheckUtils]: 16: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #112#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,224 INFO L272 TraceCheckUtils]: 21: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,224 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #114#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,224 INFO L272 TraceCheckUtils]: 26: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,225 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29777#true} {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} #116#return; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} is VALID [2022-04-28 09:31:23,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {29866#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,226 INFO L272 TraceCheckUtils]: 33: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,226 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #118#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,226 INFO L272 TraceCheckUtils]: 38: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,227 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #120#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,228 INFO L272 TraceCheckUtils]: 45: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #122#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,228 INFO L272 TraceCheckUtils]: 50: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,229 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #124#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,229 INFO L272 TraceCheckUtils]: 55: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,231 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #126#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,231 INFO L272 TraceCheckUtils]: 60: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29777#true} is VALID [2022-04-28 09:31:23,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#true} ~cond := #in~cond; {29777#true} is VALID [2022-04-28 09:31:23,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {29777#true} assume !(0 == ~cond); {29777#true} is VALID [2022-04-28 09:31:23,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {29777#true} assume true; {29777#true} is VALID [2022-04-28 09:31:23,232 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29777#true} {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} #128#return; {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} is VALID [2022-04-28 09:31:23,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {29939#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {30039#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)))} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {30039#(and (< 1 main_~r~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {29778#false} assume !(~j~0 < ~r~0); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L272 TraceCheckUtils]: 68: Hoare triple {29778#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29778#false} {29778#false} #118#return; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L272 TraceCheckUtils]: 73: Hoare triple {29778#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {29778#false} assume !(0 == ~cond); {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 76: Hoare triple {29778#false} assume true; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29778#false} {29778#false} #120#return; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 78: Hoare triple {29778#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {29778#false} is VALID [2022-04-28 09:31:23,233 INFO L290 TraceCheckUtils]: 79: Hoare triple {29778#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {29778#false} is VALID [2022-04-28 09:31:23,234 INFO L272 TraceCheckUtils]: 80: Hoare triple {29778#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {29778#false} is VALID [2022-04-28 09:31:23,234 INFO L290 TraceCheckUtils]: 81: Hoare triple {29778#false} ~cond := #in~cond; {29778#false} is VALID [2022-04-28 09:31:23,234 INFO L290 TraceCheckUtils]: 82: Hoare triple {29778#false} assume 0 == ~cond; {29778#false} is VALID [2022-04-28 09:31:23,234 INFO L290 TraceCheckUtils]: 83: Hoare triple {29778#false} assume !false; {29778#false} is VALID [2022-04-28 09:31:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-04-28 09:31:23,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:31:23,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152738797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:23,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:31:23,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-28 09:31:23,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991533403] [2022-04-28 09:31:23,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991533403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:23,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:23,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:31:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131150432] [2022-04-28 09:31:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:23,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 09:31:23,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:23,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 09:31:23,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:31:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:31:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:31:23,289 INFO L87 Difference]: Start difference. First operand 401 states and 644 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 09:31:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:25,553 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2022-04-28 09:31:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:31:25,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 09:31:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 09:31:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-28 09:31:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 09:31:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2022-04-28 09:31:25,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 224 transitions. [2022-04-28 09:31:25,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:25,717 INFO L225 Difference]: With dead ends: 714 [2022-04-28 09:31:25,717 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 09:31:25,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:31:25,719 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 39 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:25,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 237 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:31:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 09:31:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 295. [2022-04-28 09:31:26,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:26,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-28 09:31:26,791 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-28 09:31:26,792 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-28 09:31:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:26,811 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 09:31:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 09:31:26,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:26,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:26,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) Second operand 329 states. [2022-04-28 09:31:26,812 INFO L87 Difference]: Start difference. First operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) Second operand 329 states. [2022-04-28 09:31:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:26,822 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 09:31:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 09:31:26,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:26,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:26,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:26,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 154 states have internal predecessors, (183), 136 states have call successors, (136), 17 states have call predecessors, (136), 16 states have return successors, (135), 123 states have call predecessors, (135), 135 states have call successors, (135) [2022-04-28 09:31:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2022-04-28 09:31:26,857 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 84 [2022-04-28 09:31:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:26,857 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2022-04-28 09:31:26,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 09:31:26,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 454 transitions. [2022-04-28 09:31:27,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2022-04-28 09:31:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 09:31:27,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:27,430 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:27,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:31:27,630 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,SelfDestructingSolverStorable17 [2022-04-28 09:31:27,630 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 1 times [2022-04-28 09:31:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:27,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645281057] [2022-04-28 09:31:27,907 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:31:27,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -898087182, now seen corresponding path program 2 times [2022-04-28 09:31:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220029880] [2022-04-28 09:31:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {32837#(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(9, 2); {32779#true} is VALID [2022-04-28 09:31:27,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 09:31:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:31:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:31:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:31:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-28 09:31:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:31:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-28 09:31:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:31:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:31:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:27,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:27,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:27,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:27,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-04-28 09:31:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:28,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:28,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {32837#(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(9, 2); {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {32779#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {32779#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32779#true} is VALID [2022-04-28 09:31:28,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {32779#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {32779#true} is VALID [2022-04-28 09:31:28,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {32779#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {32784#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:28,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {32784#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {32785#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {32785#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #110#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,016 INFO L272 TraceCheckUtils]: 16: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #112#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,017 INFO L272 TraceCheckUtils]: 21: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,018 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #114#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,018 INFO L272 TraceCheckUtils]: 26: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,018 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #116#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {32785#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {32785#(<= 2 main_~j~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,019 INFO L272 TraceCheckUtils]: 33: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,019 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #118#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,019 INFO L272 TraceCheckUtils]: 38: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,020 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #120#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {32785#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {32785#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,021 INFO L272 TraceCheckUtils]: 45: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #122#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,021 INFO L272 TraceCheckUtils]: 50: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,022 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #124#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,022 INFO L272 TraceCheckUtils]: 55: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,022 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #126#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,022 INFO L272 TraceCheckUtils]: 60: Hoare triple {32785#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,023 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32785#(<= 2 main_~j~0)} #128#return; {32785#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:28,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {32785#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {32826#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {32826#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,024 INFO L272 TraceCheckUtils]: 68: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,024 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #118#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,025 INFO L272 TraceCheckUtils]: 73: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:28,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:28,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:28,025 INFO L290 TraceCheckUtils]: 76: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:28,025 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32779#true} {32826#(<= 2 main_~i~0)} #120#return; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,025 INFO L290 TraceCheckUtils]: 78: Hoare triple {32826#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {32826#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {32826#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:28,026 INFO L272 TraceCheckUtils]: 80: Hoare triple {32826#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:28,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {32835#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32836#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:28,027 INFO L290 TraceCheckUtils]: 82: Hoare triple {32836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32780#false} is VALID [2022-04-28 09:31:28,027 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-28 09:31:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 09:31:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:28,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220029880] [2022-04-28 09:31:28,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220029880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:28,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219749410] [2022-04-28 09:31:28,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:31:28,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:28,044 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-28 09:31:28,064 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-28 09:31:28,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:31:28,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:28,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:31:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:28,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:31:31,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {32779#true} call ULTIMATE.init(); {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {32779#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(9, 2); {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32779#true} {32779#true} #138#return; {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {32779#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {32779#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32779#true} is VALID [2022-04-28 09:31:31,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {32779#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {32859#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} is VALID [2022-04-28 09:31:31,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {32859#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) main_~l~0))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {32863#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} is VALID [2022-04-28 09:31:31,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {32863#(and (< 0 main_~l~0) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ main_~l~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,778 INFO L272 TraceCheckUtils]: 16: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,778 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,778 INFO L272 TraceCheckUtils]: 21: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,779 INFO L272 TraceCheckUtils]: 26: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,780 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,780 INFO L272 TraceCheckUtils]: 33: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #118#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,781 INFO L272 TraceCheckUtils]: 38: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,781 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #120#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,782 INFO L272 TraceCheckUtils]: 45: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,783 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #122#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,783 INFO L272 TraceCheckUtils]: 50: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,799 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #124#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,799 INFO L272 TraceCheckUtils]: 55: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #126#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,800 INFO L272 TraceCheckUtils]: 60: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {32779#true} ~cond := #in~cond; {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {32779#true} assume !(0 == ~cond); {32779#true} is VALID [2022-04-28 09:31:31,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {32779#true} assume true; {32779#true} is VALID [2022-04-28 09:31:31,801 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32779#true} {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #128#return; {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:31,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {32867#(and (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {33039#(and (< 0 (div (div main_~j~0 2) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {33039#(and (< 0 (div (div main_~j~0 2) 2)) (< (div (+ (* (- 1) main_~r~0) 1) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {32780#false} assume !(~j~0 < ~r~0); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L272 TraceCheckUtils]: 68: Hoare triple {32780#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 70: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {32780#false} {32780#false} #118#return; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L272 TraceCheckUtils]: 73: Hoare triple {32780#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {32780#false} assume !(0 == ~cond); {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {32780#false} assume true; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {32780#false} {32780#false} #120#return; {32780#false} is VALID [2022-04-28 09:31:31,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {32780#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {32780#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L272 TraceCheckUtils]: 80: Hoare triple {32780#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {32780#false} ~cond := #in~cond; {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {32780#false} assume 0 == ~cond; {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {32780#false} assume !false; {32780#false} is VALID [2022-04-28 09:31:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-04-28 09:31:31,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:31:31,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219749410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:31,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:31:31,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-28 09:31:31,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:31,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645281057] [2022-04-28 09:31:31,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645281057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:31,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:31,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:31:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912662366] [2022-04-28 09:31:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:31,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 84 [2022-04-28 09:31:31,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:31,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 09:31:31,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:31,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:31:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:31:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:31:31,832 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 09:31:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:33,480 INFO L93 Difference]: Finished difference Result 549 states and 838 transitions. [2022-04-28 09:31:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:31:33,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 84 [2022-04-28 09:31:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 09:31:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-28 09:31:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 09:31:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-04-28 09:31:33,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 168 transitions. [2022-04-28 09:31:33,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:33,665 INFO L225 Difference]: With dead ends: 549 [2022-04-28 09:31:33,665 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 09:31:33,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:31:33,667 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:33,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:31:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 09:31:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 238. [2022-04-28 09:31:34,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:34,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:34,665 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:34,665 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:34,669 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-28 09:31:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-28 09:31:34,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:34,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:34,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 249 states. [2022-04-28 09:31:34,671 INFO L87 Difference]: Start difference. First operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 249 states. [2022-04-28 09:31:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:34,675 INFO L93 Difference]: Finished difference Result 249 states and 369 transitions. [2022-04-28 09:31:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2022-04-28 09:31:34,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:34,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:34,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:34,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 127 states have internal predecessors, (147), 104 states have call successors, (104), 17 states have call predecessors, (104), 16 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 354 transitions. [2022-04-28 09:31:34,681 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 354 transitions. Word has length 84 [2022-04-28 09:31:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:34,681 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 354 transitions. [2022-04-28 09:31:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 09:31:34,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 354 transitions. [2022-04-28 09:31:35,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 354 transitions. [2022-04-28 09:31:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 09:31:35,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:35,187 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:35,205 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-28 09:31:35,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:35,388 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-04-28 09:31:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:35,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361884422] [2022-04-28 09:31:35,388 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 2 times [2022-04-28 09:31:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:35,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128362326] [2022-04-28 09:31:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {35245#(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(9, 2); {35169#true} is VALID [2022-04-28 09:31:35,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 09:31:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-28 09:31:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-28 09:31:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:31:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:31:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:31:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:31:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:31:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:31:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:31:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:31:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:31:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:31:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:31:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:31:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:31:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:35,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {35245#(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(9, 2); {35169#true} is VALID [2022-04-28 09:31:35,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 09:31:35,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-28 09:31:35,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-28 09:31:35,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {35169#true} assume !!(~j~0 <= ~r~0); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {35169#true} assume !(~j~0 < ~r~0); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L272 TraceCheckUtils]: 11: Hoare triple {35169#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35169#true} #118#return; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L272 TraceCheckUtils]: 16: Hoare triple {35169#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35169#true} #120#return; {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {35169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {35169#true} assume 0 != #t~nondet5;havoc #t~nondet5; {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {35169#true} assume ~l~0 > 1; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:35,571 INFO L272 TraceCheckUtils]: 24: Hoare triple {35182#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,571 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #130#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:35,572 INFO L272 TraceCheckUtils]: 29: Hoare triple {35182#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,572 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35182#(<= 2 main_~l~0)} #132#return; {35182#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:35,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {35182#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35191#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {35191#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {35192#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {35192#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,573 INFO L272 TraceCheckUtils]: 38: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #110#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,574 INFO L272 TraceCheckUtils]: 43: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #112#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,574 INFO L272 TraceCheckUtils]: 48: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,575 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #114#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,575 INFO L272 TraceCheckUtils]: 53: Hoare triple {35192#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,575 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,575 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35192#(<= 2 main_~j~0)} #116#return; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {35192#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35192#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:35,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {35192#(<= 2 main_~j~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,576 INFO L272 TraceCheckUtils]: 60: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,576 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #118#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,576 INFO L272 TraceCheckUtils]: 65: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,577 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #120#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {35209#(<= 3 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {35209#(<= 3 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,577 INFO L272 TraceCheckUtils]: 72: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #122#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,578 INFO L272 TraceCheckUtils]: 77: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,578 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,579 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #124#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,579 INFO L272 TraceCheckUtils]: 82: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,579 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,595 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #126#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,595 INFO L272 TraceCheckUtils]: 87: Hoare triple {35209#(<= 3 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,596 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35209#(<= 3 main_~j~0)} #128#return; {35209#(<= 3 main_~j~0)} is VALID [2022-04-28 09:31:35,596 INFO L290 TraceCheckUtils]: 92: Hoare triple {35209#(<= 3 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,596 INFO L290 TraceCheckUtils]: 93: Hoare triple {35234#(<= 3 main_~i~0)} assume !!(~j~0 <= ~r~0); {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {35234#(<= 3 main_~i~0)} assume !(~j~0 < ~r~0); {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,597 INFO L272 TraceCheckUtils]: 95: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,597 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,598 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #118#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,598 INFO L272 TraceCheckUtils]: 100: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:35,598 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:35,598 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:35,598 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:35,599 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35234#(<= 3 main_~i~0)} #120#return; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,599 INFO L290 TraceCheckUtils]: 105: Hoare triple {35234#(<= 3 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,599 INFO L290 TraceCheckUtils]: 106: Hoare triple {35234#(<= 3 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {35234#(<= 3 main_~i~0)} is VALID [2022-04-28 09:31:35,604 INFO L272 TraceCheckUtils]: 107: Hoare triple {35234#(<= 3 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:35,604 INFO L290 TraceCheckUtils]: 108: Hoare triple {35243#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35244#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:35,605 INFO L290 TraceCheckUtils]: 109: Hoare triple {35244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 09:31:35,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 09:31:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 09:31:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128362326] [2022-04-28 09:31:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128362326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321064843] [2022-04-28 09:31:35,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:31:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:35,607 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-28 09:31:35,625 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-28 09:31:35,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:31:35,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:35,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:31:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:35,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:31:40,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-28 09:31:40,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#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(9, 2); {35169#true} is VALID [2022-04-28 09:31:40,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 09:31:40,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-28 09:31:40,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-28 09:31:40,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-28 09:31:40,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-28 09:31:40,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35273#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {35273#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {35273#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {35273#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,037 INFO L272 TraceCheckUtils]: 11: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,037 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35280#(<= main_~r~0 (* main_~l~0 2))} #118#return; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,037 INFO L272 TraceCheckUtils]: 16: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,038 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35280#(<= main_~r~0 (* main_~l~0 2))} #120#return; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {35280#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:40,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {35280#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:31:40,039 INFO L272 TraceCheckUtils]: 24: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,039 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:31:40,040 INFO L272 TraceCheckUtils]: 29: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,040 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:31:40,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {35320#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35354#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-28 09:31:40,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {35354#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,051 INFO L272 TraceCheckUtils]: 38: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,062 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,062 INFO L272 TraceCheckUtils]: 43: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,063 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,063 INFO L272 TraceCheckUtils]: 48: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,063 INFO L272 TraceCheckUtils]: 53: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,064 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:31:40,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {35358#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,065 INFO L272 TraceCheckUtils]: 60: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,066 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #118#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,066 INFO L272 TraceCheckUtils]: 65: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,066 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,067 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #120#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,067 INFO L272 TraceCheckUtils]: 72: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #122#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,068 INFO L272 TraceCheckUtils]: 77: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,068 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,069 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #124#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,069 INFO L272 TraceCheckUtils]: 82: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,069 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #126#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,069 INFO L272 TraceCheckUtils]: 87: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,070 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,070 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,070 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #128#return; {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:31:40,071 INFO L290 TraceCheckUtils]: 92: Hoare triple {35431#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35531#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} is VALID [2022-04-28 09:31:40,071 INFO L290 TraceCheckUtils]: 93: Hoare triple {35531#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} assume !!(~j~0 <= ~r~0); {35170#false} is VALID [2022-04-28 09:31:40,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-28 09:31:40,071 INFO L272 TraceCheckUtils]: 95: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 96: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 97: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 98: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35170#false} {35170#false} #118#return; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L272 TraceCheckUtils]: 100: Hoare triple {35170#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 101: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 102: Hoare triple {35170#false} assume !(0 == ~cond); {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 103: Hoare triple {35170#false} assume true; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35170#false} {35170#false} #120#return; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L272 TraceCheckUtils]: 107: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35170#false} is VALID [2022-04-28 09:31:40,072 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 09:31:40,073 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 09:31:40,073 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 09:31:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 09:31:40,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:31:40,786 INFO L290 TraceCheckUtils]: 110: Hoare triple {35170#false} assume !false; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {35170#false} assume 0 == ~cond; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 108: Hoare triple {35170#false} ~cond := #in~cond; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L272 TraceCheckUtils]: 107: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 106: Hoare triple {35170#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 105: Hoare triple {35170#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35169#true} {35170#false} #120#return; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 103: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 102: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 101: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,787 INFO L272 TraceCheckUtils]: 100: Hoare triple {35170#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,787 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35169#true} {35170#false} #118#return; {35170#false} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 98: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,787 INFO L290 TraceCheckUtils]: 97: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,788 INFO L290 TraceCheckUtils]: 96: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,788 INFO L272 TraceCheckUtils]: 95: Hoare triple {35170#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {35170#false} assume !(~j~0 < ~r~0); {35170#false} is VALID [2022-04-28 09:31:40,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {35637#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {35170#false} is VALID [2022-04-28 09:31:40,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {35637#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-28 09:31:40,789 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #128#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,789 INFO L290 TraceCheckUtils]: 88: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,790 INFO L272 TraceCheckUtils]: 87: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,790 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #126#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,790 INFO L290 TraceCheckUtils]: 83: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,790 INFO L272 TraceCheckUtils]: 82: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,791 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #124#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,791 INFO L290 TraceCheckUtils]: 80: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,791 INFO L272 TraceCheckUtils]: 77: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,792 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #122#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,792 INFO L272 TraceCheckUtils]: 72: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,794 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #120#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,794 INFO L290 TraceCheckUtils]: 68: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,794 INFO L290 TraceCheckUtils]: 66: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,794 INFO L272 TraceCheckUtils]: 65: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,795 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35169#true} {35641#(< main_~r~0 (* main_~j~0 2))} #118#return; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,795 INFO L272 TraceCheckUtils]: 60: Hoare triple {35641#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {35641#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:40,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,796 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L272 TraceCheckUtils]: 53: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,797 INFO L272 TraceCheckUtils]: 48: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,798 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,798 INFO L272 TraceCheckUtils]: 43: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,798 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {35169#true} {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,799 INFO L272 TraceCheckUtils]: 38: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {35814#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35741#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:31:40,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {35814#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-28 09:31:40,801 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35169#true} {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #132#return; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:31:40,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,801 INFO L272 TraceCheckUtils]: 29: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,802 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35169#true} {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #130#return; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:31:40,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,802 INFO L272 TraceCheckUtils]: 24: Hoare triple {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1; {35818#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:31:40,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume 0 != #t~nondet5;havoc #t~nondet5; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:31:40,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:31:40,804 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35169#true} {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #120#return; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:31:40,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,804 INFO L272 TraceCheckUtils]: 16: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35169#true} {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #118#return; {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:31:40,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {35169#true} assume !(0 == ~cond); {35169#true} is VALID [2022-04-28 09:31:40,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {35169#true} ~cond := #in~cond; {35169#true} is VALID [2022-04-28 09:31:40,805 INFO L272 TraceCheckUtils]: 11: Hoare triple {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {35169#true} is VALID [2022-04-28 09:31:40,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !(~j~0 < ~r~0); {35852#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:31:40,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !!(~j~0 <= ~r~0); {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-28 09:31:40,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {35169#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {35892#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-28 09:31:40,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {35169#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {35169#true} is VALID [2022-04-28 09:31:40,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {35169#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {35169#true} is VALID [2022-04-28 09:31:40,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {35169#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {35169#true} is VALID [2022-04-28 09:31:40,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {35169#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {35169#true} is VALID [2022-04-28 09:31:40,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35169#true} {35169#true} #138#return; {35169#true} is VALID [2022-04-28 09:31:40,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {35169#true} assume true; {35169#true} is VALID [2022-04-28 09:31:40,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {35169#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(9, 2); {35169#true} is VALID [2022-04-28 09:31:40,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {35169#true} call ULTIMATE.init(); {35169#true} is VALID [2022-04-28 09:31:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 09:31:40,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321064843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:31:40,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:31:40,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-28 09:31:40,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:40,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361884422] [2022-04-28 09:31:40,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361884422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:40,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:40,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:31:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094706236] [2022-04-28 09:31:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-28 09:31:40,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:40,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 09:31:40,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:40,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:31:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:31:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:31:40,852 INFO L87 Difference]: Start difference. First operand 238 states and 354 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 09:31:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:43,866 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2022-04-28 09:31:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:31:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-28 09:31:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 09:31:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-28 09:31:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 09:31:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-04-28 09:31:43,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-04-28 09:31:44,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:44,043 INFO L225 Difference]: With dead ends: 350 [2022-04-28 09:31:44,044 INFO L226 Difference]: Without dead ends: 348 [2022-04-28 09:31:44,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:31:44,048 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:44,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 101 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 09:31:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-28 09:31:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 294. [2022-04-28 09:31:45,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:45,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 09:31:45,662 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 09:31:45,662 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 09:31:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:45,669 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-28 09:31:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-28 09:31:45,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:45,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:45,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) Second operand 348 states. [2022-04-28 09:31:45,670 INFO L87 Difference]: Start difference. First operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) Second operand 348 states. [2022-04-28 09:31:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:45,679 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2022-04-28 09:31:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2022-04-28 09:31:45,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:45,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:45,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:45,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 142 states have (on average 1.295774647887324) internal successors, (184), 156 states have internal predecessors, (184), 134 states have call successors, (134), 18 states have call predecessors, (134), 17 states have return successors, (133), 119 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-28 09:31:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 451 transitions. [2022-04-28 09:31:45,691 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 451 transitions. Word has length 111 [2022-04-28 09:31:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:45,693 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 451 transitions. [2022-04-28 09:31:45,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 09:31:45,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 451 transitions. [2022-04-28 09:31:46,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 451 transitions. [2022-04-28 09:31:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 09:31:46,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:46,341 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:46,373 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-28 09:31:46,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:46,542 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 1 times [2022-04-28 09:31:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:46,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1199101949] [2022-04-28 09:31:46,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 977427545, now seen corresponding path program 2 times [2022-04-28 09:31:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:46,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753497832] [2022-04-28 09:31:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {38008#(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(9, 2); {37933#true} is VALID [2022-04-28 09:31:46,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 09:31:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-28 09:31:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-28 09:31:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:31:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:31:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:31:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:31:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:31:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:31:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:31:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:31:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:31:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:31:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:31:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:31:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:31:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {38008#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:46,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {38008#(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(9, 2); {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-28 09:31:46,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {37933#true} assume !!(~j~0 <= ~r~0); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {37933#true} assume !(~j~0 < ~r~0); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {37933#true} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {37933#true} #118#return; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L272 TraceCheckUtils]: 16: Hoare triple {37933#true} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,668 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {37933#true} #120#return; {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {37933#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {37933#true} assume 0 != #t~nondet5;havoc #t~nondet5; {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {37933#true} assume ~l~0 > 1; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:46,669 INFO L272 TraceCheckUtils]: 24: Hoare triple {37946#(<= 2 main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,670 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #130#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:46,670 INFO L272 TraceCheckUtils]: 29: Hoare triple {37946#(<= 2 main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,670 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {37946#(<= 2 main_~l~0)} #132#return; {37946#(<= 2 main_~l~0)} is VALID [2022-04-28 09:31:46,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {37946#(<= 2 main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {37955#(<= 1 main_~l~0)} is VALID [2022-04-28 09:31:46,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {37955#(<= 1 main_~l~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {37956#(<= 2 main_~j~0)} assume !!(~j~0 <= ~r~0); {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {37956#(<= 2 main_~j~0)} assume ~j~0 < ~r~0; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,672 INFO L272 TraceCheckUtils]: 38: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #110#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,672 INFO L272 TraceCheckUtils]: 43: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #112#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,673 INFO L272 TraceCheckUtils]: 48: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,673 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #114#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,674 INFO L272 TraceCheckUtils]: 53: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,674 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #116#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {37956#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {37956#(<= 2 main_~j~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,675 INFO L272 TraceCheckUtils]: 60: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,675 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #118#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,675 INFO L272 TraceCheckUtils]: 65: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,676 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #120#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {37956#(<= 2 main_~j~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,676 INFO L290 TraceCheckUtils]: 71: Hoare triple {37956#(<= 2 main_~j~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,677 INFO L272 TraceCheckUtils]: 72: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #122#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,677 INFO L272 TraceCheckUtils]: 77: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,678 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #124#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,678 INFO L272 TraceCheckUtils]: 82: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,678 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,678 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,678 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,678 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #126#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,678 INFO L272 TraceCheckUtils]: 87: Hoare triple {37956#(<= 2 main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,679 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,679 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,679 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {37956#(<= 2 main_~j~0)} #128#return; {37956#(<= 2 main_~j~0)} is VALID [2022-04-28 09:31:46,679 INFO L290 TraceCheckUtils]: 92: Hoare triple {37956#(<= 2 main_~j~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {37997#(<= 2 main_~i~0)} assume !!(~j~0 <= ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {37997#(<= 2 main_~i~0)} assume !(~j~0 < ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,680 INFO L272 TraceCheckUtils]: 95: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,680 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,681 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,681 INFO L272 TraceCheckUtils]: 100: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:46,681 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:46,681 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:46,681 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:46,681 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,681 INFO L290 TraceCheckUtils]: 105: Hoare triple {37997#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,682 INFO L290 TraceCheckUtils]: 106: Hoare triple {37997#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:46,682 INFO L272 TraceCheckUtils]: 107: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:31:46,683 INFO L290 TraceCheckUtils]: 108: Hoare triple {38006#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38007#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:31:46,683 INFO L290 TraceCheckUtils]: 109: Hoare triple {38007#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 09:31:46,683 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 09:31:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 09:31:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:46,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753497832] [2022-04-28 09:31:46,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753497832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905743325] [2022-04-28 09:31:46,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:31:46,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:46,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:46,700 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-28 09:31:46,711 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-28 09:31:46,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:31:46,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:46,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:31:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:46,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:31:49,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-28 09:31:49,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#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(9, 2); {37933#true} is VALID [2022-04-28 09:31:49,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 09:31:49,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-28 09:31:49,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-28 09:31:49,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-28 09:31:49,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-28 09:31:49,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38036#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-28 09:31:49,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {38036#(<= (* main_~l~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume !(~j~0 < ~r~0); {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #118#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,364 INFO L272 TraceCheckUtils]: 16: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,365 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #120#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} assume ~l~0 > 1; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,366 INFO L272 TraceCheckUtils]: 24: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,367 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #130#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,367 INFO L272 TraceCheckUtils]: 29: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,367 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {38040#(<= (* main_~l~0 2) main_~r~0)} #132#return; {38040#(<= (* main_~l~0 2) main_~r~0)} is VALID [2022-04-28 09:31:49,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {38040#(<= (* main_~l~0 2) main_~r~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38116#(<= (+ main_~l~0 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {38116#(<= (+ main_~l~0 1) (div main_~r~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !!(~j~0 <= ~r~0); {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume ~j~0 < ~r~0; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,370 INFO L272 TraceCheckUtils]: 38: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #110#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,370 INFO L272 TraceCheckUtils]: 43: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,371 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #112#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,371 INFO L272 TraceCheckUtils]: 48: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,372 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #114#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,372 INFO L272 TraceCheckUtils]: 53: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,372 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #116#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,373 INFO L272 TraceCheckUtils]: 60: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,373 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,374 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #118#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,374 INFO L272 TraceCheckUtils]: 65: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,374 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #120#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,375 INFO L272 TraceCheckUtils]: 72: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,376 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #122#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,376 INFO L272 TraceCheckUtils]: 77: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,377 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #124#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,377 INFO L272 TraceCheckUtils]: 82: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,377 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,377 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #126#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,377 INFO L272 TraceCheckUtils]: 87: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,378 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} #128#return; {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} is VALID [2022-04-28 09:31:49,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {38120#(<= (+ (div (- main_~j~0) (- 2)) 1) (div main_~r~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} is VALID [2022-04-28 09:31:49,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} assume !!(~j~0 <= ~r~0); {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} is VALID [2022-04-28 09:31:49,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {38292#(and (<= 0 (+ main_~i~0 (div (* (- 1) main_~j~0) 2))) (<= (+ (div (div (* (- 1) main_~j~0) 2) (- 2)) 1) (div main_~r~0 2)))} assume !(~j~0 < ~r~0); {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:49,380 INFO L272 TraceCheckUtils]: 95: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,380 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #118#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:49,381 INFO L272 TraceCheckUtils]: 100: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:49,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:49,381 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:49,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:49,382 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {37997#(<= 2 main_~i~0)} #120#return; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:49,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {37997#(<= 2 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:49,382 INFO L290 TraceCheckUtils]: 106: Hoare triple {37997#(<= 2 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {37997#(<= 2 main_~i~0)} is VALID [2022-04-28 09:31:49,383 INFO L272 TraceCheckUtils]: 107: Hoare triple {37997#(<= 2 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:31:49,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:31:49,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 09:31:49,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 09:31:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 09:31:49,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:31:50,607 INFO L290 TraceCheckUtils]: 110: Hoare triple {37934#false} assume !false; {37934#false} is VALID [2022-04-28 09:31:50,607 INFO L290 TraceCheckUtils]: 109: Hoare triple {38342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37934#false} is VALID [2022-04-28 09:31:50,608 INFO L290 TraceCheckUtils]: 108: Hoare triple {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:31:50,608 INFO L272 TraceCheckUtils]: 107: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {38338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:31:50,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {38358#(<= 1 main_~i~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:50,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {38358#(<= 1 main_~i~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:50,609 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #120#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 103: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 102: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 101: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L272 TraceCheckUtils]: 100: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {37933#true} {38358#(<= 1 main_~i~0)} #118#return; {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,609 INFO L272 TraceCheckUtils]: 95: Hoare triple {38358#(<= 1 main_~i~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,610 INFO L290 TraceCheckUtils]: 94: Hoare triple {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} assume !(~j~0 < ~r~0); {38358#(<= 1 main_~i~0)} is VALID [2022-04-28 09:31:50,610 INFO L290 TraceCheckUtils]: 93: Hoare triple {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} assume !!(~j~0 <= ~r~0); {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:31:50,610 INFO L290 TraceCheckUtils]: 92: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {38398#(or (< main_~j~0 main_~r~0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:31:50,611 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #128#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 90: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 89: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 88: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L272 TraceCheckUtils]: 87: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #126#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 84: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L290 TraceCheckUtils]: 83: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,611 INFO L272 TraceCheckUtils]: 82: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #124#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,612 INFO L290 TraceCheckUtils]: 80: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L272 TraceCheckUtils]: 77: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #122#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,613 INFO L272 TraceCheckUtils]: 72: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,614 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #120#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,614 INFO L272 TraceCheckUtils]: 65: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,614 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #118#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,615 INFO L290 TraceCheckUtils]: 61: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,615 INFO L272 TraceCheckUtils]: 60: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,615 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #116#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,616 INFO L272 TraceCheckUtils]: 53: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,617 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #114#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,617 INFO L272 TraceCheckUtils]: 48: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #112#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L272 TraceCheckUtils]: 43: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37933#true} {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} #110#return; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,618 INFO L272 TraceCheckUtils]: 38: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume ~j~0 < ~r~0; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} assume !!(~j~0 <= ~r~0); {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {38577#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< (* main_~l~0 2) (+ (div (+ (- 1) main_~r~0) 2) 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38405#(or (<= 1 main_~j~0) (< (* main_~j~0 2) main_~r~0))} is VALID [2022-04-28 09:31:50,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {38577#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< (* main_~l~0 2) (+ (div (+ (- 1) main_~r~0) 2) 1)))} is VALID [2022-04-28 09:31:50,620 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #132#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,620 INFO L272 TraceCheckUtils]: 29: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,621 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #130#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,621 INFO L272 TraceCheckUtils]: 24: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume ~l~0 > 1; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume 0 != #t~nondet5;havoc #t~nondet5; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,622 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #120#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,622 INFO L272 TraceCheckUtils]: 16: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,622 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37933#true} {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} #118#return; {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {37933#true} assume !(0 == ~cond); {37933#true} is VALID [2022-04-28 09:31:50,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {37933#true} ~cond := #in~cond; {37933#true} is VALID [2022-04-28 09:31:50,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {37933#true} is VALID [2022-04-28 09:31:50,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} assume !(~j~0 < ~r~0); {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {38657#(or (<= 0 (+ (div (+ main_~j~0 (- 3)) 2) 1)) (<= main_~l~0 (+ (div (+ (- 1) (div (+ main_~j~0 (- 3)) 2)) 2) 2)))} assume !!(~j~0 <= ~r~0); {38581#(or (<= 0 (div (+ (- 1) main_~r~0) 2)) (< main_~l~0 (+ 2 (div (div (+ (- 1) main_~r~0) 2) 2))))} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {37933#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {38657#(or (<= 0 (+ (div (+ main_~j~0 (- 3)) 2) 1)) (<= main_~l~0 (+ (div (+ (- 1) (div (+ main_~j~0 (- 3)) 2)) 2) 2)))} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {37933#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {37933#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {37933#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {37933#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37933#true} {37933#true} #138#return; {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {37933#true} assume true; {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {37933#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(9, 2); {37933#true} is VALID [2022-04-28 09:31:50,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {37933#true} call ULTIMATE.init(); {37933#true} is VALID [2022-04-28 09:31:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 09:31:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905743325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:31:50,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:31:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2022-04-28 09:31:50,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:31:50,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1199101949] [2022-04-28 09:31:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1199101949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:31:50,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:31:50,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:31:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658211242] [2022-04-28 09:31:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:31:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 111 [2022-04-28 09:31:50,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:31:50,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-28 09:31:50,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:50,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:31:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:31:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:31:50,656 INFO L87 Difference]: Start difference. First operand 294 states and 451 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-28 09:31:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:53,554 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-04-28 09:31:53,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:31:53,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 111 [2022-04-28 09:31:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:31:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-28 09:31:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-28 09:31:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-28 09:31:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-04-28 09:31:53,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2022-04-28 09:31:53,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:53,677 INFO L225 Difference]: With dead ends: 323 [2022-04-28 09:31:53,677 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 09:31:53,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:31:53,678 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:31:53,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 77 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:31:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 09:31:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 242. [2022-04-28 09:31:55,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:31:55,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:55,150 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:55,150 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:55,157 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-28 09:31:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-28 09:31:55,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:55,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:55,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 321 states. [2022-04-28 09:31:55,158 INFO L87 Difference]: Start difference. First operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) Second operand 321 states. [2022-04-28 09:31:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:31:55,164 INFO L93 Difference]: Finished difference Result 321 states and 490 transitions. [2022-04-28 09:31:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2022-04-28 09:31:55,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:31:55,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:31:55,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:31:55,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:31:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 120 states have (on average 1.25) internal successors, (150), 130 states have internal predecessors, (150), 104 states have call successors, (104), 18 states have call predecessors, (104), 17 states have return successors, (103), 93 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-28 09:31:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2022-04-28 09:31:55,170 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 111 [2022-04-28 09:31:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:31:55,170 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2022-04-28 09:31:55,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-28 09:31:55,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 357 transitions. [2022-04-28 09:31:55,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:31:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2022-04-28 09:31:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 09:31:55,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:31:55,720 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:31:55,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:31:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:55,920 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:31:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:31:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 3 times [2022-04-28 09:31:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:31:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586366757] [2022-04-28 09:31:55,921 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:31:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1099325000, now seen corresponding path program 4 times [2022-04-28 09:31:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:31:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791453360] [2022-04-28 09:31:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:31:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:31:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:31:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {40557#(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(9, 2); {40477#true} is VALID [2022-04-28 09:31:56,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 09:31:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:31:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:31:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:31:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:31:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:31:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #110#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:31:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #112#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:31:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #114#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:31:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #116#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:31:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:31:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:31:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:31:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:31:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:31:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:31:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 09:31:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:31:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 09:31:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-28 09:31:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 09:31:56,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {40557#(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(9, 2); {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-28 09:31:56,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,081 INFO L272 TraceCheckUtils]: 16: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,081 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:31:56,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,083 INFO L272 TraceCheckUtils]: 24: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,083 INFO L272 TraceCheckUtils]: 29: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,084 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {40492#(<= (+ main_~r~0 4) (* main_~l~0 4))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {40501#(<= main_~r~0 (* main_~l~0 4))} is VALID [2022-04-28 09:31:56,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {40501#(<= main_~r~0 (* main_~l~0 4))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,085 INFO L272 TraceCheckUtils]: 38: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #110#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,086 INFO L272 TraceCheckUtils]: 43: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #112#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,087 INFO L272 TraceCheckUtils]: 48: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #114#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,087 INFO L272 TraceCheckUtils]: 53: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,088 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {40502#(<= main_~r~0 (* main_~j~0 2))} #116#return; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {40502#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {40502#(<= main_~r~0 (* main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,089 INFO L272 TraceCheckUtils]: 60: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,089 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #118#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,089 INFO L272 TraceCheckUtils]: 65: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,090 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,090 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,090 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #120#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,091 INFO L272 TraceCheckUtils]: 72: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,091 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,091 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #122#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,091 INFO L272 TraceCheckUtils]: 77: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #124#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,092 INFO L272 TraceCheckUtils]: 82: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,092 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,093 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #126#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,093 INFO L272 TraceCheckUtils]: 87: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,093 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} #128#return; {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} is VALID [2022-04-28 09:31:56,094 INFO L290 TraceCheckUtils]: 92: Hoare triple {40519#(<= (+ main_~r~0 2) (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40544#(<= (+ main_~r~0 2) main_~j~0)} is VALID [2022-04-28 09:31:56,094 INFO L290 TraceCheckUtils]: 93: Hoare triple {40544#(<= (+ main_~r~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-28 09:31:56,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 09:31:56,094 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 09:31:56,095 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 09:31:56,095 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:31:56,095 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 09:31:56,095 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:31:56,096 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:31:56,096 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 09:31:56,096 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 09:31:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 09:31:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:31:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791453360] [2022-04-28 09:31:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791453360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:31:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714904643] [2022-04-28 09:31:56,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:31:56,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:31:56,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:31:56,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:31:56,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 09:31:56,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:31:56,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:31:56,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:31:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:31:56,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:32:02,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-28 09:32:02,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#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(9, 2); {40477#true} is VALID [2022-04-28 09:32:02,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 09:32:02,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-28 09:32:02,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-28 09:32:02,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-28 09:32:02,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-28 09:32:02,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {40482#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {40482#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #118#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,355 INFO L272 TraceCheckUtils]: 16: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,356 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {40483#(<= main_~r~0 (* main_~l~0 2))} #120#return; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {40483#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:02,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {40483#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:02,357 INFO L272 TraceCheckUtils]: 24: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:02,358 INFO L272 TraceCheckUtils]: 29: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,359 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:02,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {40630#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {40664#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-28 09:32:02,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {40664#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,361 INFO L272 TraceCheckUtils]: 38: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,362 INFO L272 TraceCheckUtils]: 43: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,363 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,363 INFO L272 TraceCheckUtils]: 48: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,364 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,364 INFO L272 TraceCheckUtils]: 53: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,365 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:02,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {40668#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,366 INFO L272 TraceCheckUtils]: 60: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,367 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #118#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,367 INFO L272 TraceCheckUtils]: 65: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,367 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,367 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,368 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #120#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,369 INFO L272 TraceCheckUtils]: 72: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,369 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,369 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,370 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #122#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,370 INFO L272 TraceCheckUtils]: 77: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,370 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,371 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #124#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,371 INFO L272 TraceCheckUtils]: 82: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,371 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #126#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,372 INFO L272 TraceCheckUtils]: 87: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:02,372 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:02,372 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:02,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:02,372 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} #128#return; {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} is VALID [2022-04-28 09:32:02,373 INFO L290 TraceCheckUtils]: 92: Hoare triple {40741#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (+ (- 1) main_~j~0) 2) 1)) (< 0 (div (+ (- 1) main_~j~0) 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40841#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} is VALID [2022-04-28 09:32:02,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {40841#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div (+ (- 2) main_~j~0) 2) 2) 1)) (< 0 (div (div (+ (- 2) main_~j~0) 2) 2)))} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L290 TraceCheckUtils]: 97: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 09:32:02,374 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40478#false} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 102: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 103: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40478#false} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 108: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 109: Hoare triple {40478#false} assume !(0 == ~cond); {40478#false} is VALID [2022-04-28 09:32:02,375 INFO L290 TraceCheckUtils]: 110: Hoare triple {40478#false} assume true; {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40478#false} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 09:32:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2022-04-28 09:32:02,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:32:03,301 INFO L290 TraceCheckUtils]: 115: Hoare triple {40478#false} assume !false; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 114: Hoare triple {40478#false} assume 0 == ~cond; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 113: Hoare triple {40478#false} ~cond := #in~cond; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L272 TraceCheckUtils]: 112: Hoare triple {40478#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {40477#true} {40478#false} #122#return; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 110: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 109: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 108: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,302 INFO L272 TraceCheckUtils]: 107: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 106: Hoare triple {40478#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {40478#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40478#false} is VALID [2022-04-28 09:32:03,302 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {40477#true} {40478#false} #120#return; {40478#false} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 102: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 101: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L272 TraceCheckUtils]: 100: Hoare triple {40478#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {40477#true} {40478#false} #118#return; {40478#false} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L272 TraceCheckUtils]: 95: Hoare triple {40478#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {40478#false} assume !(~j~0 < ~r~0); {40478#false} is VALID [2022-04-28 09:32:03,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {40977#(not (<= main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {40478#false} is VALID [2022-04-28 09:32:03,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {40977#(not (<= main_~j~0 main_~r~0))} is VALID [2022-04-28 09:32:03,305 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #128#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,305 INFO L272 TraceCheckUtils]: 87: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,306 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #126#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,306 INFO L272 TraceCheckUtils]: 82: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,307 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #124#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,307 INFO L272 TraceCheckUtils]: 77: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,307 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #122#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,308 INFO L272 TraceCheckUtils]: 72: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,309 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #120#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,310 INFO L272 TraceCheckUtils]: 65: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,310 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {40477#true} {40981#(< main_~r~0 (* main_~j~0 2))} #118#return; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,310 INFO L272 TraceCheckUtils]: 60: Hoare triple {40981#(< main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {40981#(< main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:03,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,312 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #116#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,312 INFO L272 TraceCheckUtils]: 53: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,313 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #114#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,313 INFO L272 TraceCheckUtils]: 48: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,314 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #112#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,314 INFO L272 TraceCheckUtils]: 43: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,314 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {40477#true} {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} #110#return; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,315 INFO L272 TraceCheckUtils]: 38: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume ~j~0 < ~r~0; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} assume !!(~j~0 <= ~r~0); {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {41081#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~j~0 2))} is VALID [2022-04-28 09:32:03,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {41154#(< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (* main_~l~0 2) 2))} is VALID [2022-04-28 09:32:03,317 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {40477#true} {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #132#return; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:32:03,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,318 INFO L272 TraceCheckUtils]: 29: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,318 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {40477#true} {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} #130#return; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:32:03,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,319 INFO L272 TraceCheckUtils]: 24: Hoare triple {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume ~l~0 > 1; {41158#(< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0)} is VALID [2022-04-28 09:32:03,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume 0 != #t~nondet5;havoc #t~nondet5; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:03,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:03,321 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40477#true} {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #120#return; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:03,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,321 INFO L272 TraceCheckUtils]: 16: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,322 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40477#true} {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} #118#return; {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:03,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {40477#true} assume !(0 == ~cond); {40477#true} is VALID [2022-04-28 09:32:03,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {40477#true} ~cond := #in~cond; {40477#true} is VALID [2022-04-28 09:32:03,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {40477#true} is VALID [2022-04-28 09:32:03,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !(~j~0 < ~r~0); {41192#(or (< (div (+ 1 (* (- 1) (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)))) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:03,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} assume !!(~j~0 <= ~r~0); {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {40477#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {41232#(or (not (< 1 main_~l~0)) (<= (div (+ (- 1) (div (+ (- 1) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0))} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {40477#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {40477#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {40477#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {40477#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40477#true} {40477#true} #138#return; {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {40477#true} assume true; {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {40477#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(9, 2); {40477#true} is VALID [2022-04-28 09:32:03,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {40477#true} call ULTIMATE.init(); {40477#true} is VALID [2022-04-28 09:32:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 09:32:03,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714904643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:32:03,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:32:03,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-04-28 09:32:03,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:32:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586366757] [2022-04-28 09:32:03,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586366757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:32:03,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:32:03,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:32:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117499989] [2022-04-28 09:32:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:32:03,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 116 [2022-04-28 09:32:03,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:32:03,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-28 09:32:03,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:32:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:32:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:32:03,382 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-28 09:32:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:10,765 INFO L93 Difference]: Finished difference Result 756 states and 1173 transitions. [2022-04-28 09:32:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 09:32:10,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 116 [2022-04-28 09:32:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:32:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-28 09:32:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-28 09:32:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-28 09:32:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 472 transitions. [2022-04-28 09:32:10,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 472 transitions. [2022-04-28 09:32:11,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:11,110 INFO L225 Difference]: With dead ends: 756 [2022-04-28 09:32:11,110 INFO L226 Difference]: Without dead ends: 452 [2022-04-28 09:32:11,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 09:32:11,112 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:32:11,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 116 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 09:32:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-28 09:32:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2022-04-28 09:32:12,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:32:12,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 09:32:12,960 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 09:32:12,960 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 09:32:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:12,972 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-28 09:32:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-28 09:32:12,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:12,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:12,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) Second operand 452 states. [2022-04-28 09:32:12,974 INFO L87 Difference]: Start difference. First operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) Second operand 452 states. [2022-04-28 09:32:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:12,986 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2022-04-28 09:32:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 699 transitions. [2022-04-28 09:32:12,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:12,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:12,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:32:12,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:32:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 183 states have internal predecessors, (216), 177 states have call successors, (177), 18 states have call predecessors, (177), 17 states have return successors, (176), 162 states have call predecessors, (176), 176 states have call successors, (176) [2022-04-28 09:32:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 569 transitions. [2022-04-28 09:32:12,998 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 569 transitions. Word has length 116 [2022-04-28 09:32:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:32:12,998 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 569 transitions. [2022-04-28 09:32:12,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-28 09:32:12,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 569 transitions. [2022-04-28 09:32:13,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 569 transitions. [2022-04-28 09:32:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 09:32:13,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:32:13,954 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:32:13,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 09:32:14,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:14,167 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:32:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:32:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 3 times [2022-04-28 09:32:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068427702] [2022-04-28 09:32:14,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:32:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1934725046, now seen corresponding path program 4 times [2022-04-28 09:32:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:32:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597672675] [2022-04-28 09:32:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:32:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:32:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:32:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {44534#(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(9, 2); {44453#true} is VALID [2022-04-28 09:32:14,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 09:32:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:32:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #118#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:32:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:32:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:32:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:32:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:32:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:32:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:32:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:32:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:32:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:32:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:32:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:32:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:32:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:32:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:32:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-04-28 09:32:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:32:14,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {44534#(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(9, 2); {44453#true} is VALID [2022-04-28 09:32:14,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 09:32:14,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-28 09:32:14,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-28 09:32:14,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44458#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:14,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {44458#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44458#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:14,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {44458#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44459#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} is VALID [2022-04-28 09:32:14,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {44459#(<= (+ (* main_~l~0 2) main_~r~0) (+ main_~n~0 main_~j~0))} assume !!(~j~0 <= ~r~0); {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #118#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,308 INFO L272 TraceCheckUtils]: 16: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,309 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,327 INFO L272 TraceCheckUtils]: 24: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,329 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,329 INFO L272 TraceCheckUtils]: 29: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,329 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-28 09:32:14,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume ~j~0 < ~r~0; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,331 INFO L272 TraceCheckUtils]: 38: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #110#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,331 INFO L272 TraceCheckUtils]: 43: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #112#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,332 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #114#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,333 INFO L272 TraceCheckUtils]: 53: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,333 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #116#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,334 INFO L272 TraceCheckUtils]: 60: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #118#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,334 INFO L272 TraceCheckUtils]: 65: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,335 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #120#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,335 INFO L272 TraceCheckUtils]: 72: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,335 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,336 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #122#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,336 INFO L272 TraceCheckUtils]: 77: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #124#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,337 INFO L272 TraceCheckUtils]: 82: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #126#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,337 INFO L272 TraceCheckUtils]: 87: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,338 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44478#(<= (+ main_~j~0 2) main_~n~0)} #128#return; {44478#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,338 INFO L290 TraceCheckUtils]: 92: Hoare triple {44478#(<= (+ main_~j~0 2) main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !!(~j~0 <= ~r~0); {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !(~j~0 < ~r~0); {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,338 INFO L272 TraceCheckUtils]: 95: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #118#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,339 INFO L272 TraceCheckUtils]: 100: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,339 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,340 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #120#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,340 INFO L290 TraceCheckUtils]: 105: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,340 INFO L290 TraceCheckUtils]: 106: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,340 INFO L272 TraceCheckUtils]: 107: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:14,340 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:14,340 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:14,340 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:14,341 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44519#(<= (+ main_~i~0 2) main_~n~0)} #122#return; {44519#(<= (+ main_~i~0 2) main_~n~0)} is VALID [2022-04-28 09:32:14,341 INFO L272 TraceCheckUtils]: 112: Hoare triple {44519#(<= (+ main_~i~0 2) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:14,341 INFO L290 TraceCheckUtils]: 113: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {44533#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:32:14,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {44533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 09:32:14,342 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 09:32:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 09:32:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:32:14,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597672675] [2022-04-28 09:32:14,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597672675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:32:14,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720979249] [2022-04-28 09:32:14,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:32:14,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:32:14,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:32:14,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 09:32:14,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:32:14,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:32:14,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:32:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:14,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:32:16,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-28 09:32:16,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#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(9, 2); {44453#true} is VALID [2022-04-28 09:32:16,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 09:32:16,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-28 09:32:16,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-28 09:32:16,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44453#true} is VALID [2022-04-28 09:32:16,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {44453#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44453#true} is VALID [2022-04-28 09:32:16,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {44453#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-28 09:32:16,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} assume !!(~j~0 <= ~r~0); {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-28 09:32:16,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} assume !(~j~0 < ~r~0); {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-28 09:32:16,763 INFO L272 TraceCheckUtils]: 11: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {44562#(<= (* main_~l~0 2) main_~j~0)} #118#return; {44562#(<= (* main_~l~0 2) main_~j~0)} is VALID [2022-04-28 09:32:16,763 INFO L272 TraceCheckUtils]: 16: Hoare triple {44562#(<= (* main_~l~0 2) main_~j~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:16,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {44590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:16,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:16,765 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} {44562#(<= (* main_~l~0 2) main_~j~0)} #120#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume ~l~0 > 1; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,766 INFO L272 TraceCheckUtils]: 24: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,767 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #130#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,767 INFO L272 TraceCheckUtils]: 29: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,767 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {44460#(<= (* main_~l~0 2) main_~n~0)} #132#return; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:16,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} is VALID [2022-04-28 09:32:16,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {44477#(<= (+ (* main_~l~0 2) 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume ~j~0 < ~r~0; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,769 INFO L272 TraceCheckUtils]: 38: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #110#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,770 INFO L272 TraceCheckUtils]: 43: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,771 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #112#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,771 INFO L272 TraceCheckUtils]: 48: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,772 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #114#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,772 INFO L272 TraceCheckUtils]: 53: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,772 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #116#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,773 INFO L272 TraceCheckUtils]: 60: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,774 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,774 INFO L272 TraceCheckUtils]: 65: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,775 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,776 INFO L272 TraceCheckUtils]: 72: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,776 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,776 INFO L272 TraceCheckUtils]: 77: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #124#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,777 INFO L272 TraceCheckUtils]: 82: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,777 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,778 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #126#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,778 INFO L272 TraceCheckUtils]: 87: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,778 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,778 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,778 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,778 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #128#return; {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,779 INFO L290 TraceCheckUtils]: 92: Hoare triple {44645#(<= (div (- main_~j~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !!(~j~0 <= ~r~0); {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,780 INFO L290 TraceCheckUtils]: 94: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(~j~0 < ~r~0); {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,780 INFO L272 TraceCheckUtils]: 95: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,780 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,780 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,780 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #118#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,780 INFO L272 TraceCheckUtils]: 100: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,780 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,781 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #120#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,782 INFO L290 TraceCheckUtils]: 106: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,782 INFO L272 TraceCheckUtils]: 107: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:16,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:16,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:16,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:16,783 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} #122#return; {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} is VALID [2022-04-28 09:32:16,784 INFO L272 TraceCheckUtils]: 112: Hoare triple {44817#(<= (div (- main_~i~0) (- 2)) (div (+ (- 2) main_~n~0) 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:16,784 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:16,784 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 09:32:16,784 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 09:32:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 37 proven. 66 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 09:32:16,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:32:17,764 INFO L290 TraceCheckUtils]: 115: Hoare triple {44454#false} assume !false; {44454#false} is VALID [2022-04-28 09:32:17,765 INFO L290 TraceCheckUtils]: 114: Hoare triple {44882#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44454#false} is VALID [2022-04-28 09:32:17,765 INFO L290 TraceCheckUtils]: 113: Hoare triple {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44882#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:17,765 INFO L272 TraceCheckUtils]: 112: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44878#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:17,766 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #122#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,766 INFO L290 TraceCheckUtils]: 110: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,766 INFO L290 TraceCheckUtils]: 109: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,766 INFO L290 TraceCheckUtils]: 108: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,766 INFO L272 TraceCheckUtils]: 107: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,766 INFO L290 TraceCheckUtils]: 106: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,767 INFO L290 TraceCheckUtils]: 105: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,767 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #120#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,767 INFO L290 TraceCheckUtils]: 103: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,767 INFO L290 TraceCheckUtils]: 102: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,767 INFO L290 TraceCheckUtils]: 101: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,767 INFO L272 TraceCheckUtils]: 100: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,768 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {44453#true} {44898#(<= main_~i~0 main_~n~0)} #118#return; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,768 INFO L290 TraceCheckUtils]: 97: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,768 INFO L290 TraceCheckUtils]: 96: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,768 INFO L272 TraceCheckUtils]: 95: Hoare triple {44898#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,768 INFO L290 TraceCheckUtils]: 94: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,769 INFO L290 TraceCheckUtils]: 93: Hoare triple {44898#(<= main_~i~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,769 INFO L290 TraceCheckUtils]: 92: Hoare triple {44959#(<= main_~j~0 main_~n~0)} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {44898#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:17,769 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #128#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,769 INFO L290 TraceCheckUtils]: 90: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L290 TraceCheckUtils]: 89: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L290 TraceCheckUtils]: 88: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L272 TraceCheckUtils]: 87: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #126#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,770 INFO L272 TraceCheckUtils]: 82: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,771 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #124#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,771 INFO L290 TraceCheckUtils]: 80: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,771 INFO L290 TraceCheckUtils]: 79: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,771 INFO L290 TraceCheckUtils]: 78: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,771 INFO L272 TraceCheckUtils]: 77: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,772 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #122#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,772 INFO L272 TraceCheckUtils]: 72: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,773 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #120#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,773 INFO L272 TraceCheckUtils]: 65: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,774 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #118#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,774 INFO L272 TraceCheckUtils]: 60: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,775 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #116#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,775 INFO L272 TraceCheckUtils]: 53: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,775 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #114#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L272 TraceCheckUtils]: 48: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #112#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,776 INFO L272 TraceCheckUtils]: 43: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,777 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {44453#true} {44959#(<= main_~j~0 main_~n~0)} #110#return; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,777 INFO L272 TraceCheckUtils]: 38: Hoare triple {44959#(<= main_~j~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume ~j~0 < ~r~0; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {44959#(<= main_~j~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {44460#(<= (* main_~l~0 2) main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {44959#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 09:32:17,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {44460#(<= (* main_~l~0 2) main_~n~0)} is VALID [2022-04-28 09:32:17,779 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {44453#true} {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #132#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,779 INFO L272 TraceCheckUtils]: 29: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,780 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {44453#true} {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} #130#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,780 INFO L272 TraceCheckUtils]: 24: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume ~l~0 > 1; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume 0 != #t~nondet5;havoc #t~nondet5; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,782 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} #120#return; {45134#(<= main_~l~0 (+ (div main_~n~0 2) 1))} is VALID [2022-04-28 09:32:17,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:17,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {45187#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {44532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:17,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {44453#true} ~cond := #in~cond; {45187#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:32:17,783 INFO L272 TraceCheckUtils]: 16: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44453#true} {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} #118#return; {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-28 09:32:17,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {44453#true} assume !(0 == ~cond); {44453#true} is VALID [2022-04-28 09:32:17,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {44453#true} ~cond := #in~cond; {44453#true} is VALID [2022-04-28 09:32:17,783 INFO L272 TraceCheckUtils]: 11: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {44453#true} is VALID [2022-04-28 09:32:17,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} assume !(~j~0 < ~r~0); {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-28 09:32:17,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} assume !!(~j~0 <= ~r~0); {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {44453#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {45177#(<= main_~l~0 (+ 2 (div (+ (- 2) main_~j~0) 2)))} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {44453#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {44453#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {44453#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {44453#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44453#true} {44453#true} #138#return; {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {44453#true} assume true; {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {44453#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(9, 2); {44453#true} is VALID [2022-04-28 09:32:17,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {44453#true} call ULTIMATE.init(); {44453#true} is VALID [2022-04-28 09:32:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 37 proven. 66 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 09:32:17,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720979249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:32:17,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:32:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-28 09:32:17,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:32:17,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068427702] [2022-04-28 09:32:17,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068427702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:32:17,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:32:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:32:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660976010] [2022-04-28 09:32:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:32:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 116 [2022-04-28 09:32:17,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:32:17,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 09:32:17,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:32:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:32:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:32:17,836 INFO L87 Difference]: Start difference. First operand 364 states and 569 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 09:32:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:25,186 INFO L93 Difference]: Finished difference Result 620 states and 983 transitions. [2022-04-28 09:32:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:32:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 116 [2022-04-28 09:32:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:32:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 09:32:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-28 09:32:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 09:32:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2022-04-28 09:32:25,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 245 transitions. [2022-04-28 09:32:25,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:25,371 INFO L225 Difference]: With dead ends: 620 [2022-04-28 09:32:25,371 INFO L226 Difference]: Without dead ends: 618 [2022-04-28 09:32:25,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:32:25,372 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:32:25,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 89 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 09:32:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-04-28 09:32:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 501. [2022-04-28 09:32:27,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:32:27,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-28 09:32:27,730 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-28 09:32:27,730 INFO L87 Difference]: Start difference. First operand 618 states. Second operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-28 09:32:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:27,750 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-28 09:32:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-28 09:32:27,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:27,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:27,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) Second operand 618 states. [2022-04-28 09:32:27,752 INFO L87 Difference]: Start difference. First operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) Second operand 618 states. [2022-04-28 09:32:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:27,773 INFO L93 Difference]: Finished difference Result 618 states and 981 transitions. [2022-04-28 09:32:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2022-04-28 09:32:27,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:27,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:27,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:32:27,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:32:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 250 states have internal predecessors, (299), 250 states have call successors, (250), 23 states have call predecessors, (250), 22 states have return successors, (249), 227 states have call predecessors, (249), 249 states have call successors, (249) [2022-04-28 09:32:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 798 transitions. [2022-04-28 09:32:27,798 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 798 transitions. Word has length 116 [2022-04-28 09:32:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:32:27,799 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 798 transitions. [2022-04-28 09:32:27,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-04-28 09:32:27,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 501 states and 798 transitions. [2022-04-28 09:32:29,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 798 transitions. [2022-04-28 09:32:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 09:32:29,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:32:29,043 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:32:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 09:32:29,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:29,243 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:32:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:32:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 5 times [2022-04-28 09:32:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477986223] [2022-04-28 09:32:29,244 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:32:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1563563510, now seen corresponding path program 6 times [2022-04-28 09:32:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:32:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547184764] [2022-04-28 09:32:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:32:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:32:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:32:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {48841#(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(9, 2); {48744#true} is VALID [2022-04-28 09:32:29,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 09:32:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:32:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:32:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:32:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:32:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:32:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:32:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:32:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-28 09:32:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:32:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:32:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 09:32:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-28 09:32:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:32:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:32:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 09:32:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-04-28 09:32:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 09:32:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-04-28 09:32:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 09:32:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 09:32:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 09:32:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:32:29,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {48841#(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(9, 2); {48744#true} is VALID [2022-04-28 09:32:29,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 09:32:29,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-28 09:32:29,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-28 09:32:29,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:29,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:29,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-28 09:32:29,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-28 09:32:29,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {48750#(<= (+ (* main_~l~0 2) (* main_~r~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume ~j~0 < ~r~0; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,418 INFO L272 TraceCheckUtils]: 11: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #110#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,419 INFO L272 TraceCheckUtils]: 16: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #112#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,419 INFO L272 TraceCheckUtils]: 21: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #114#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,420 INFO L272 TraceCheckUtils]: 26: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,421 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #116#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,421 INFO L272 TraceCheckUtils]: 33: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,422 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #118#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,422 INFO L272 TraceCheckUtils]: 38: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,423 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} #120#return; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {48751#(<= (+ (* main_~l~0 2) main_~r~0 1) (* main_~n~0 2))} assume ~l~0 > 1; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,424 INFO L272 TraceCheckUtils]: 46: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #130#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,424 INFO L272 TraceCheckUtils]: 51: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,425 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #132#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !!(~j~0 <= ~r~0); {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume ~j~0 < ~r~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,426 INFO L272 TraceCheckUtils]: 60: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #110#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,427 INFO L272 TraceCheckUtils]: 65: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #112#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,427 INFO L272 TraceCheckUtils]: 70: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #114#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,428 INFO L272 TraceCheckUtils]: 75: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,428 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #116#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,429 INFO L290 TraceCheckUtils]: 80: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,429 INFO L272 TraceCheckUtils]: 82: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,429 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,429 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,430 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #118#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,430 INFO L272 TraceCheckUtils]: 87: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,430 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,430 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,430 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,430 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #120#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,431 INFO L290 TraceCheckUtils]: 92: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,431 INFO L290 TraceCheckUtils]: 93: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,431 INFO L272 TraceCheckUtils]: 94: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,431 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,431 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #122#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,432 INFO L272 TraceCheckUtils]: 99: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #124#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,432 INFO L272 TraceCheckUtils]: 104: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,432 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,433 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #126#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,433 INFO L272 TraceCheckUtils]: 109: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,433 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,433 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,433 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,433 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} #128#return; {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} is VALID [2022-04-28 09:32:29,434 INFO L290 TraceCheckUtils]: 114: Hoare triple {48776#(<= (+ 5 main_~r~0) (* main_~n~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {48825#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} is VALID [2022-04-28 09:32:29,434 INFO L290 TraceCheckUtils]: 115: Hoare triple {48825#(<= (+ 5 main_~r~0 (* main_~i~0 2)) (+ main_~j~0 (* main_~n~0 2)))} assume !!(~j~0 <= ~r~0); {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 116: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume !(~j~0 < ~r~0); {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,435 INFO L272 TraceCheckUtils]: 117: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #118#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,435 INFO L272 TraceCheckUtils]: 122: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,435 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,436 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #120#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,436 INFO L290 TraceCheckUtils]: 127: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,436 INFO L290 TraceCheckUtils]: 128: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,436 INFO L272 TraceCheckUtils]: 129: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:29,436 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:29,436 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:29,437 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:29,437 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {48826#(<= (+ main_~i~0 3) main_~n~0)} #122#return; {48826#(<= (+ main_~i~0 3) main_~n~0)} is VALID [2022-04-28 09:32:29,437 INFO L272 TraceCheckUtils]: 134: Hoare triple {48826#(<= (+ main_~i~0 3) main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48839#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:32:29,438 INFO L290 TraceCheckUtils]: 135: Hoare triple {48839#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {48840#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:32:29,438 INFO L290 TraceCheckUtils]: 136: Hoare triple {48840#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 09:32:29,438 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 09:32:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 09:32:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:32:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547184764] [2022-04-28 09:32:29,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547184764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:32:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702757103] [2022-04-28 09:32:29,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:32:29,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:29,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:32:29,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:32:29,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 09:32:29,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:32:29,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:32:29,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:32:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:29,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:32:30,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-28 09:32:30,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#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(9, 2); {48744#true} is VALID [2022-04-28 09:32:30,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 09:32:30,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-28 09:32:30,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-28 09:32:30,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~j~0 < ~r~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #110#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,345 INFO L272 TraceCheckUtils]: 16: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #112#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,346 INFO L272 TraceCheckUtils]: 21: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #114#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,346 INFO L272 TraceCheckUtils]: 26: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,347 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #116#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,347 INFO L272 TraceCheckUtils]: 33: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,348 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #118#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,348 INFO L272 TraceCheckUtils]: 38: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,348 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #120#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,349 INFO L272 TraceCheckUtils]: 46: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,349 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #130#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,349 INFO L272 TraceCheckUtils]: 51: Hoare triple {48749#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,350 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {48749#(<= main_~r~0 main_~n~0)} #132#return; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {48749#(<= main_~r~0 main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {48749#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:30,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {48749#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,351 INFO L272 TraceCheckUtils]: 60: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,351 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,351 INFO L272 TraceCheckUtils]: 65: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,352 INFO L272 TraceCheckUtils]: 70: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,352 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,353 INFO L272 TraceCheckUtils]: 75: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,353 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,353 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,353 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 81: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,354 INFO L272 TraceCheckUtils]: 82: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,354 INFO L272 TraceCheckUtils]: 87: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,354 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,355 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,355 INFO L290 TraceCheckUtils]: 92: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,355 INFO L290 TraceCheckUtils]: 93: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,355 INFO L272 TraceCheckUtils]: 94: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,355 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,355 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,356 INFO L272 TraceCheckUtils]: 99: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,356 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,356 INFO L272 TraceCheckUtils]: 104: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,357 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,357 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,357 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,360 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,360 INFO L272 TraceCheckUtils]: 109: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,360 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,360 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,360 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,360 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:30,361 INFO L290 TraceCheckUtils]: 114: Hoare triple {49016#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {49188#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:30,361 INFO L290 TraceCheckUtils]: 115: Hoare triple {49188#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,361 INFO L290 TraceCheckUtils]: 116: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(~j~0 < ~r~0); {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,362 INFO L272 TraceCheckUtils]: 117: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #118#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,362 INFO L272 TraceCheckUtils]: 122: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,362 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,363 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #120#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,363 INFO L290 TraceCheckUtils]: 127: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,363 INFO L290 TraceCheckUtils]: 128: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,363 INFO L272 TraceCheckUtils]: 129: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,363 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,363 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,363 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,364 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #122#return; {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:30,365 INFO L272 TraceCheckUtils]: 134: Hoare triple {49192#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:30,369 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:30,369 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 09:32:30,369 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 09:32:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-28 09:32:30,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:32:30,876 INFO L290 TraceCheckUtils]: 137: Hoare triple {48745#false} assume !false; {48745#false} is VALID [2022-04-28 09:32:30,876 INFO L290 TraceCheckUtils]: 136: Hoare triple {49254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48745#false} is VALID [2022-04-28 09:32:30,877 INFO L290 TraceCheckUtils]: 135: Hoare triple {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:30,877 INFO L272 TraceCheckUtils]: 134: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {49250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:30,877 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #122#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,877 INFO L290 TraceCheckUtils]: 132: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,877 INFO L290 TraceCheckUtils]: 131: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,877 INFO L290 TraceCheckUtils]: 130: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,878 INFO L272 TraceCheckUtils]: 129: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,878 INFO L290 TraceCheckUtils]: 128: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,878 INFO L290 TraceCheckUtils]: 127: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,878 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #120#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,878 INFO L290 TraceCheckUtils]: 125: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,878 INFO L290 TraceCheckUtils]: 124: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,878 INFO L290 TraceCheckUtils]: 123: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L272 TraceCheckUtils]: 122: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {48744#true} {49270#(<= main_~i~0 main_~n~0)} #118#return; {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,879 INFO L290 TraceCheckUtils]: 120: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L290 TraceCheckUtils]: 119: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L272 TraceCheckUtils]: 117: Hoare triple {49270#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,879 INFO L290 TraceCheckUtils]: 116: Hoare triple {49270#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {49328#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} assume !!(~j~0 <= ~r~0); {49270#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:30,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {49328#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:32:30,880 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,880 INFO L290 TraceCheckUtils]: 111: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L272 TraceCheckUtils]: 109: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,881 INFO L290 TraceCheckUtils]: 107: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L272 TraceCheckUtils]: 104: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,881 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L272 TraceCheckUtils]: 99: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L290 TraceCheckUtils]: 95: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,882 INFO L272 TraceCheckUtils]: 94: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,883 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,883 INFO L272 TraceCheckUtils]: 87: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,884 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,884 INFO L272 TraceCheckUtils]: 82: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,884 INFO L290 TraceCheckUtils]: 80: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,885 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L272 TraceCheckUtils]: 75: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 72: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L290 TraceCheckUtils]: 71: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,885 INFO L272 TraceCheckUtils]: 70: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 67: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L272 TraceCheckUtils]: 65: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {48744#true} {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,887 INFO L272 TraceCheckUtils]: 60: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49332#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:30,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,888 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #132#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L272 TraceCheckUtils]: 51: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #130#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,889 INFO L272 TraceCheckUtils]: 46: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet5;havoc #t~nondet5; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,889 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #120#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L272 TraceCheckUtils]: 38: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #118#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L272 TraceCheckUtils]: 33: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,891 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #116#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,891 INFO L272 TraceCheckUtils]: 26: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,891 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #114#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L272 TraceCheckUtils]: 21: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #112#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,892 INFO L272 TraceCheckUtils]: 16: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#true} {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #110#return; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#true} assume !(0 == ~cond); {48744#true} is VALID [2022-04-28 09:32:30,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#true} ~cond := #in~cond; {48744#true} is VALID [2022-04-28 09:32:30,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {48744#true} is VALID [2022-04-28 09:32:30,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~j~0 < ~r~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~j~0 <= ~r~0); {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {48744#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {49504#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:30,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {48744#true} is VALID [2022-04-28 09:32:30,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {48744#true} is VALID [2022-04-28 09:32:30,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#true} {48744#true} #138#return; {48744#true} is VALID [2022-04-28 09:32:30,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#true} assume true; {48744#true} is VALID [2022-04-28 09:32:30,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {48744#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(9, 2); {48744#true} is VALID [2022-04-28 09:32:30,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {48744#true} call ULTIMATE.init(); {48744#true} is VALID [2022-04-28 09:32:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 54 proven. 14 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-28 09:32:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702757103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:32:30,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:32:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-04-28 09:32:30,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:32:30,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477986223] [2022-04-28 09:32:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477986223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:32:30,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:32:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:32:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899653484] [2022-04-28 09:32:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:32:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 138 [2022-04-28 09:32:30,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:32:30,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-28 09:32:30,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:32:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:32:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:32:30,935 INFO L87 Difference]: Start difference. First operand 501 states and 798 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-28 09:32:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:38,406 INFO L93 Difference]: Finished difference Result 770 states and 1246 transitions. [2022-04-28 09:32:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:32:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 138 [2022-04-28 09:32:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:32:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-28 09:32:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-28 09:32:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-28 09:32:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-04-28 09:32:38,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 240 transitions. [2022-04-28 09:32:38,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:38,611 INFO L225 Difference]: With dead ends: 770 [2022-04-28 09:32:38,611 INFO L226 Difference]: Without dead ends: 309 [2022-04-28 09:32:38,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:32:38,613 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:32:38,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 09:32:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-28 09:32:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 213. [2022-04-28 09:32:39,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:32:39,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-28 09:32:39,630 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-28 09:32:39,631 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-28 09:32:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:39,639 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-28 09:32:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-28 09:32:39,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:39,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:39,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) Second operand 309 states. [2022-04-28 09:32:39,641 INFO L87 Difference]: Start difference. First operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) Second operand 309 states. [2022-04-28 09:32:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:39,649 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2022-04-28 09:32:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2022-04-28 09:32:39,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:39,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:39,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:32:39,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:32:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 72 states have call successors, (72), 23 states have call predecessors, (72), 22 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-28 09:32:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2022-04-28 09:32:39,656 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 138 [2022-04-28 09:32:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:32:39,656 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2022-04-28 09:32:39,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-04-28 09:32:39,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 280 transitions. [2022-04-28 09:32:40,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2022-04-28 09:32:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 09:32:40,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:32:40,131 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:32:40,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 09:32:40,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 09:32:40,347 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:32:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:32:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 1 times [2022-04-28 09:32:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:40,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911406948] [2022-04-28 09:32:40,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:32:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -915763573, now seen corresponding path program 2 times [2022-04-28 09:32:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:32:40,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987445966] [2022-04-28 09:32:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:32:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:32:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:32:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {52410#(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(9, 2); {52289#true} is VALID [2022-04-28 09:32:40,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 09:32:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:32:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:32:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:32:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #130#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:32:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #132#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:32:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #110#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:32:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #112#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:32:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #114#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:32:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #116#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:32:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #118#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:32:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #120#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:32:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #122#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:32:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #124#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:32:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #126#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:32:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #128#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:32:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #110#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:32:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #112#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-28 09:32:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #114#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 09:32:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #116#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 09:32:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #118#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 09:32:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #120#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 09:32:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #122#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 09:32:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #124#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-28 09:32:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #126#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 09:32:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #128#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-28 09:32:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-28 09:32:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-28 09:32:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:40,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {52410#(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(9, 2); {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-28 09:32:40,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,534 INFO L272 TraceCheckUtils]: 11: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,535 INFO L272 TraceCheckUtils]: 16: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,535 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:40,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,536 INFO L272 TraceCheckUtils]: 24: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #130#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,537 INFO L272 TraceCheckUtils]: 29: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,538 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #132#return; {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {52304#(<= (+ main_~r~0 12) (* main_~l~0 8))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {52313#(<= (+ main_~r~0 4) (* main_~l~0 8))} is VALID [2022-04-28 09:32:40,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {52313#(<= (+ main_~r~0 4) (* main_~l~0 8))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !!(~j~0 <= ~r~0); {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume ~j~0 < ~r~0; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,539 INFO L272 TraceCheckUtils]: 38: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #110#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,540 INFO L272 TraceCheckUtils]: 43: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #112#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,540 INFO L272 TraceCheckUtils]: 48: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,541 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #114#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,541 INFO L272 TraceCheckUtils]: 53: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,542 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #116#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !(0 != #t~nondet4);havoc #t~nondet4; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,542 INFO L272 TraceCheckUtils]: 60: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,543 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #118#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,543 INFO L272 TraceCheckUtils]: 65: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,543 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #120#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,544 INFO L290 TraceCheckUtils]: 70: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,544 INFO L290 TraceCheckUtils]: 71: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,544 INFO L272 TraceCheckUtils]: 72: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,544 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,544 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #122#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,545 INFO L272 TraceCheckUtils]: 77: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #124#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,545 INFO L272 TraceCheckUtils]: 82: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,546 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #126#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,546 INFO L272 TraceCheckUtils]: 87: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,546 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} #128#return; {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} is VALID [2022-04-28 09:32:40,547 INFO L290 TraceCheckUtils]: 92: Hoare triple {52314#(<= (+ main_~r~0 4) (* main_~j~0 4))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 94: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume ~j~0 < ~r~0; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,548 INFO L272 TraceCheckUtils]: 95: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #110#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,548 INFO L272 TraceCheckUtils]: 100: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,549 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #112#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,549 INFO L272 TraceCheckUtils]: 105: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,549 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,549 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,549 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #114#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,549 INFO L272 TraceCheckUtils]: 110: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,550 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,550 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,550 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} #116#return; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,550 INFO L290 TraceCheckUtils]: 115: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,551 INFO L290 TraceCheckUtils]: 116: Hoare triple {52355#(<= (+ main_~r~0 4) (* main_~j~0 2))} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,551 INFO L272 TraceCheckUtils]: 117: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,551 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,551 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,551 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #118#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,552 INFO L272 TraceCheckUtils]: 122: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,552 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,552 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,552 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,552 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #120#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,552 INFO L290 TraceCheckUtils]: 127: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,553 INFO L290 TraceCheckUtils]: 128: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,553 INFO L272 TraceCheckUtils]: 129: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,553 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,553 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,553 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,553 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #122#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,554 INFO L272 TraceCheckUtils]: 134: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #124#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,554 INFO L272 TraceCheckUtils]: 139: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,554 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,555 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #126#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,555 INFO L272 TraceCheckUtils]: 144: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,555 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,555 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,555 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,555 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} #128#return; {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 149: Hoare triple {52372#(<= (+ main_~r~0 6) (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52397#(<= (+ main_~r~0 6) main_~j~0)} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 150: Hoare triple {52397#(<= (+ main_~r~0 6) main_~j~0)} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 09:32:40,556 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,556 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:40,557 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 09:32:40,557 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:40,557 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:40,557 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:40,558 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:40,558 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 09:32:40,558 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 09:32:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 74 proven. 32 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 09:32:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:32:40,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987445966] [2022-04-28 09:32:40,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987445966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:32:40,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906717294] [2022-04-28 09:32:40,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:32:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:32:40,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:32:40,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 09:32:40,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:32:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:32:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:32:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:40,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:32:44,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#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(9, 2); {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-28 09:32:44,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-28 09:32:44,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {52294#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {52294#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,745 INFO L272 TraceCheckUtils]: 11: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #118#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,746 INFO L272 TraceCheckUtils]: 16: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,746 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {52295#(<= main_~r~0 (* main_~l~0 2))} #120#return; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {52295#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {52295#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:44,747 INFO L272 TraceCheckUtils]: 24: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,748 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #130#return; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:44,748 INFO L272 TraceCheckUtils]: 29: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,749 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #132#return; {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} is VALID [2022-04-28 09:32:44,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {52483#(and (< 1 main_~l~0) (<= main_~r~0 (* main_~l~0 2)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {52517#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} is VALID [2022-04-28 09:32:44,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {52517#(and (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) (< 0 main_~l~0))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume ~j~0 < ~r~0; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,750 INFO L272 TraceCheckUtils]: 38: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #110#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,751 INFO L272 TraceCheckUtils]: 43: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,753 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #112#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,753 INFO L272 TraceCheckUtils]: 48: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #114#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,754 INFO L272 TraceCheckUtils]: 53: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,774 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #116#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,775 INFO L272 TraceCheckUtils]: 60: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #118#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,775 INFO L272 TraceCheckUtils]: 65: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,776 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #120#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,777 INFO L272 TraceCheckUtils]: 72: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #122#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,777 INFO L272 TraceCheckUtils]: 77: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #124#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,778 INFO L272 TraceCheckUtils]: 82: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #126#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,778 INFO L272 TraceCheckUtils]: 87: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:44,778 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:44,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:44,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:44,779 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} #128#return; {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:44,780 INFO L290 TraceCheckUtils]: 92: Hoare triple {52521#(and (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div main_~j~0 2) 1)) (< 0 (div main_~j~0 2)))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-28 09:32:44,780 INFO L290 TraceCheckUtils]: 93: Hoare triple {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume !!(~j~0 <= ~r~0); {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} is VALID [2022-04-28 09:32:44,780 INFO L290 TraceCheckUtils]: 94: Hoare triple {52693#(and (< 0 (div (div main_~j~0 2) 2)) (<= (div (* (- 1) main_~r~0) (- 2)) (+ (div (div main_~j~0 2) 2) 1)))} assume ~j~0 < ~r~0; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L272 TraceCheckUtils]: 95: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 96: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 97: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 98: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52290#false} {52290#false} #110#return; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L272 TraceCheckUtils]: 100: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 101: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52290#false} {52290#false} #112#return; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L272 TraceCheckUtils]: 105: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 106: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 107: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,781 INFO L290 TraceCheckUtils]: 108: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52290#false} {52290#false} #114#return; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L272 TraceCheckUtils]: 110: Hoare triple {52290#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 111: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 112: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52290#false} {52290#false} #116#return; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 116: Hoare triple {52290#false} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L272 TraceCheckUtils]: 117: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 118: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 119: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L272 TraceCheckUtils]: 122: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 124: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 125: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L272 TraceCheckUtils]: 129: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 130: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 131: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 132: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L272 TraceCheckUtils]: 134: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 135: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 136: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L290 TraceCheckUtils]: 137: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,783 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52290#false} {52290#false} #124#return; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L272 TraceCheckUtils]: 139: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 140: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 141: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 142: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52290#false} {52290#false} #126#return; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L272 TraceCheckUtils]: 144: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 145: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 146: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 147: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52290#false} {52290#false} #128#return; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,784 INFO L290 TraceCheckUtils]: 153: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 154: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 155: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52290#false} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 158: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 159: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 160: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52290#false} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 165: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 166: Hoare triple {52290#false} assume !(0 == ~cond); {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L290 TraceCheckUtils]: 167: Hoare triple {52290#false} assume true; {52290#false} is VALID [2022-04-28 09:32:44,785 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52290#false} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:44,786 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:44,786 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:44,786 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 09:32:44,786 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 09:32:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 794 proven. 8 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2022-04-28 09:32:44,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:32:45,734 INFO L290 TraceCheckUtils]: 172: Hoare triple {52290#false} assume !false; {52290#false} is VALID [2022-04-28 09:32:45,734 INFO L290 TraceCheckUtils]: 171: Hoare triple {52290#false} assume 0 == ~cond; {52290#false} is VALID [2022-04-28 09:32:45,734 INFO L290 TraceCheckUtils]: 170: Hoare triple {52290#false} ~cond := #in~cond; {52290#false} is VALID [2022-04-28 09:32:45,734 INFO L272 TraceCheckUtils]: 169: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52290#false} is VALID [2022-04-28 09:32:45,734 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:45,734 INFO L290 TraceCheckUtils]: 167: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 166: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 165: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L272 TraceCheckUtils]: 164: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 163: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 162: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:45,735 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 160: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 159: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 158: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L272 TraceCheckUtils]: 157: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 155: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 154: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L290 TraceCheckUtils]: 153: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,735 INFO L272 TraceCheckUtils]: 152: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 151: Hoare triple {52290#false} assume !(~j~0 < ~r~0); {52290#false} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 150: Hoare triple {52290#false} assume !!(~j~0 <= ~r~0); {52290#false} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 149: Hoare triple {52290#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {52290#false} is VALID [2022-04-28 09:32:45,736 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {52289#true} {52290#false} #128#return; {52290#false} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 147: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 146: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 145: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L272 TraceCheckUtils]: 144: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {52289#true} {52290#false} #126#return; {52290#false} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 142: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 141: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L290 TraceCheckUtils]: 140: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L272 TraceCheckUtils]: 139: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,736 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {52289#true} {52290#false} #124#return; {52290#false} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 137: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 136: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 135: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L272 TraceCheckUtils]: 134: Hoare triple {52290#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {52289#true} {52290#false} #122#return; {52290#false} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 132: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 131: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L272 TraceCheckUtils]: 129: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {52290#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {52290#false} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {52290#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:45,737 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {52289#true} {52290#false} #120#return; {52290#false} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 124: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,737 INFO L290 TraceCheckUtils]: 123: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L272 TraceCheckUtils]: 122: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {52289#true} {52290#false} #118#return; {52290#false} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 120: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 119: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 118: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L272 TraceCheckUtils]: 117: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 116: Hoare triple {52290#false} assume 0 != #t~nondet4;havoc #t~nondet4;~j~0 := 1 + ~j~0; {52290#false} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 115: Hoare triple {52290#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {52290#false} is VALID [2022-04-28 09:32:45,738 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {52289#true} {52290#false} #116#return; {52290#false} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 113: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 112: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 111: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L272 TraceCheckUtils]: 110: Hoare triple {52290#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,738 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {52289#true} {52290#false} #114#return; {52290#false} is VALID [2022-04-28 09:32:45,738 INFO L290 TraceCheckUtils]: 108: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L272 TraceCheckUtils]: 105: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {52289#true} {52290#false} #112#return; {52290#false} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 103: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 101: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L272 TraceCheckUtils]: 100: Hoare triple {52290#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52289#true} {52290#false} #110#return; {52290#false} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 97: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L290 TraceCheckUtils]: 96: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,739 INFO L272 TraceCheckUtils]: 95: Hoare triple {52290#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {53168#(not (< main_~j~0 main_~r~0))} assume ~j~0 < ~r~0; {52290#false} is VALID [2022-04-28 09:32:45,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {53168#(not (< main_~j~0 main_~r~0))} assume !!(~j~0 <= ~r~0); {53168#(not (< main_~j~0 main_~r~0))} is VALID [2022-04-28 09:32:45,742 INFO L290 TraceCheckUtils]: 92: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {53168#(not (< main_~j~0 main_~r~0))} is VALID [2022-04-28 09:32:45,742 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #128#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 90: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 89: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 88: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L272 TraceCheckUtils]: 87: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #126#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L290 TraceCheckUtils]: 83: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,743 INFO L272 TraceCheckUtils]: 82: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,744 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #124#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,744 INFO L290 TraceCheckUtils]: 79: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,744 INFO L290 TraceCheckUtils]: 78: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,744 INFO L272 TraceCheckUtils]: 77: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,745 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #122#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,745 INFO L272 TraceCheckUtils]: 72: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,746 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #120#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,746 INFO L290 TraceCheckUtils]: 68: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,746 INFO L290 TraceCheckUtils]: 67: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,746 INFO L272 TraceCheckUtils]: 65: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,747 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #118#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,751 INFO L272 TraceCheckUtils]: 60: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,752 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #116#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,752 INFO L272 TraceCheckUtils]: 53: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #114#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L272 TraceCheckUtils]: 48: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #112#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L272 TraceCheckUtils]: 43: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {52289#true} {53175#(<= main_~r~0 (* main_~j~0 2))} #110#return; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,754 INFO L272 TraceCheckUtils]: 38: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {53175#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {53347#(<= (div (- main_~r~0) (- 2)) (* main_~l~0 2))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {53175#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:45,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {53347#(<= (div (- main_~r~0) (- 2)) (* main_~l~0 2))} is VALID [2022-04-28 09:32:45,756 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {52289#true} {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #132#return; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L272 TraceCheckUtils]: 29: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {52289#true} {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} #130#return; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,757 INFO L272 TraceCheckUtils]: 24: Hoare triple {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume ~l~0 > 1; {53351#(<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0)} is VALID [2022-04-28 09:32:45,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume 0 != #t~nondet5;havoc #t~nondet5; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-28 09:32:45,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-28 09:32:45,772 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52289#true} {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} #120#return; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-28 09:32:45,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,772 INFO L272 TraceCheckUtils]: 16: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,772 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52289#true} {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} #118#return; {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-28 09:32:45,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {52289#true} assume !(0 == ~cond); {52289#true} is VALID [2022-04-28 09:32:45,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {52289#true} ~cond := #in~cond; {52289#true} is VALID [2022-04-28 09:32:45,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {52289#true} is VALID [2022-04-28 09:32:45,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume !(~j~0 < ~r~0); {53385#(or (not (< 1 main_~l~0)) (<= (+ (div (- (div (* (- 1) main_~r~0) (- 2))) (- 2)) 1) main_~l~0))} is VALID [2022-04-28 09:32:45,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} assume !!(~j~0 <= ~r~0); {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:45,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {52289#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {53425#(or (<= (div (+ (- 1) (div (+ (- 2) (* (- 1) main_~j~0)) 2)) (- 2)) main_~l~0) (not (< 1 main_~l~0)))} is VALID [2022-04-28 09:32:45,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {52289#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {52289#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {52289#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {52289#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52289#true} {52289#true} #138#return; {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {52289#true} assume true; {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {52289#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(9, 2); {52289#true} is VALID [2022-04-28 09:32:45,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {52289#true} call ULTIMATE.init(); {52289#true} is VALID [2022-04-28 09:32:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-04-28 09:32:45,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906717294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:32:45,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:32:45,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-04-28 09:32:45,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:32:45,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911406948] [2022-04-28 09:32:45,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911406948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:32:45,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:32:45,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:32:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603616580] [2022-04-28 09:32:45,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:32:45,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 173 [2022-04-28 09:32:45,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:32:45,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-28 09:32:45,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:32:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:32:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:32:45,848 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-28 09:32:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:49,664 INFO L93 Difference]: Finished difference Result 399 states and 535 transitions. [2022-04-28 09:32:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:32:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 173 [2022-04-28 09:32:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:32:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-28 09:32:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-28 09:32:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-28 09:32:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2022-04-28 09:32:49,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 223 transitions. [2022-04-28 09:32:49,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:49,810 INFO L225 Difference]: With dead ends: 399 [2022-04-28 09:32:49,811 INFO L226 Difference]: Without dead ends: 246 [2022-04-28 09:32:49,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:32:49,812 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 88 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:32:49,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 104 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:32:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-28 09:32:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 211. [2022-04-28 09:32:51,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:32:51,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 09:32:51,389 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 09:32:51,389 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 09:32:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:51,393 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-28 09:32:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-28 09:32:51,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:51,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:51,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) Second operand 246 states. [2022-04-28 09:32:51,394 INFO L87 Difference]: Start difference. First operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) Second operand 246 states. [2022-04-28 09:32:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:51,398 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2022-04-28 09:32:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2022-04-28 09:32:51,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:51,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:51,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:32:51,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:32:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 124 states have internal predecessors, (137), 70 states have call successors, (70), 23 states have call predecessors, (70), 22 states have return successors, (69), 63 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 09:32:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2022-04-28 09:32:51,402 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 173 [2022-04-28 09:32:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:32:51,402 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2022-04-28 09:32:51,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-04-28 09:32:51,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 276 transitions. [2022-04-28 09:32:51,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2022-04-28 09:32:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-28 09:32:51,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:32:51,963 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:32:51,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 09:32:52,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 09:32:52,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:32:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:32:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 5 times [2022-04-28 09:32:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506142818] [2022-04-28 09:32:52,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:32:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 345153677, now seen corresponding path program 6 times [2022-04-28 09:32:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:32:52,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875608981] [2022-04-28 09:32:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:32:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:32:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:32:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {55313#(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(9, 2); {55194#true} is VALID [2022-04-28 09:32:52,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 09:32:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 09:32:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #118#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:32:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #120#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:32:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:32:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:32:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #110#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-28 09:32:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #112#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:32:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #114#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-28 09:32:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #116#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:32:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #118#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-28 09:32:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #120#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:32:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #122#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-04-28 09:32:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #124#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:32:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #126#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-28 09:32:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #128#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-04-28 09:32:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-28 09:32:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:32:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-28 09:32:52,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-04-28 09:32:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-28 09:32:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 09:32:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-28 09:32:52,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-04-28 09:32:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 09:32:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 09:32:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 09:32:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-04-28 09:32:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 09:32:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 09:32:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-28 09:32:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-04-28 09:32:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-28 09:32:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 09:32:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-28 09:32:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-28 09:32:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 09:32:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-04-28 09:32:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 09:32:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-04-28 09:32:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 09:32:52,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:32:52,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {55313#(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(9, 2); {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-28 09:32:52,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {55194#true} is VALID [2022-04-28 09:32:52,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {55194#true} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {55194#true} is VALID [2022-04-28 09:32:52,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {55194#true} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55199#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {55199#(<= main_~j~0 (* main_~l~0 2))} assume !!(~j~0 <= ~r~0); {55199#(<= main_~j~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {55199#(<= main_~j~0 (* main_~l~0 2))} assume !(~j~0 < ~r~0); {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #118#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,323 INFO L272 TraceCheckUtils]: 16: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,324 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {55200#(<= main_~r~0 (* main_~l~0 2))} #120#return; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume 0 != #t~nondet5;havoc #t~nondet5; {55200#(<= main_~r~0 (* main_~l~0 2))} is VALID [2022-04-28 09:32:52,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {55200#(<= main_~r~0 (* main_~l~0 2))} assume ~l~0 > 1; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,325 INFO L272 TraceCheckUtils]: 24: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,326 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #130#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,326 INFO L272 TraceCheckUtils]: 29: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,326 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #132#return; {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {55209#(<= (+ main_~r~0 4) (* main_~l~0 4))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {55218#(<= main_~r~0 (* main_~l~0 4))} is VALID [2022-04-28 09:32:52,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {55218#(<= main_~r~0 (* main_~l~0 4))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !!(~j~0 <= ~r~0); {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume ~j~0 < ~r~0; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,328 INFO L272 TraceCheckUtils]: 38: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,328 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #110#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,329 INFO L272 TraceCheckUtils]: 43: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #112#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,329 INFO L272 TraceCheckUtils]: 48: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,330 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #114#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,330 INFO L272 TraceCheckUtils]: 53: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,330 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #116#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,331 INFO L272 TraceCheckUtils]: 60: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,332 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #118#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,332 INFO L272 TraceCheckUtils]: 65: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,332 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,332 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #120#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,333 INFO L272 TraceCheckUtils]: 72: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,333 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,333 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,334 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #122#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,334 INFO L272 TraceCheckUtils]: 77: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,334 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #124#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,335 INFO L272 TraceCheckUtils]: 82: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #126#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,335 INFO L272 TraceCheckUtils]: 87: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,335 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,336 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55219#(<= main_~r~0 (* main_~j~0 2))} #128#return; {55219#(<= main_~r~0 (* main_~j~0 2))} is VALID [2022-04-28 09:32:52,336 INFO L290 TraceCheckUtils]: 92: Hoare triple {55219#(<= main_~r~0 (* main_~j~0 2))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55260#(<= main_~r~0 main_~j~0)} is VALID [2022-04-28 09:32:52,336 INFO L290 TraceCheckUtils]: 93: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume !!(~j~0 <= ~r~0); {55260#(<= main_~r~0 main_~j~0)} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {55260#(<= main_~r~0 main_~j~0)} assume ~j~0 < ~r~0; {55195#false} is VALID [2022-04-28 09:32:52,337 INFO L272 TraceCheckUtils]: 95: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55195#false} #110#return; {55195#false} is VALID [2022-04-28 09:32:52,337 INFO L272 TraceCheckUtils]: 100: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,337 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55195#false} #112#return; {55195#false} is VALID [2022-04-28 09:32:52,338 INFO L272 TraceCheckUtils]: 105: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55195#false} #114#return; {55195#false} is VALID [2022-04-28 09:32:52,338 INFO L272 TraceCheckUtils]: 110: Hoare triple {55195#false} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55195#false} #116#return; {55195#false} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {55195#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55195#false} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {55195#false} assume !(0 != #t~nondet4);havoc #t~nondet4; {55195#false} is VALID [2022-04-28 09:32:52,338 INFO L272 TraceCheckUtils]: 117: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 09:32:52,339 INFO L272 TraceCheckUtils]: 122: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 127: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 128: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-28 09:32:52,339 INFO L272 TraceCheckUtils]: 129: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,339 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 09:32:52,339 INFO L272 TraceCheckUtils]: 134: Hoare triple {55195#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55195#false} #124#return; {55195#false} is VALID [2022-04-28 09:32:52,340 INFO L272 TraceCheckUtils]: 139: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55195#false} #126#return; {55195#false} is VALID [2022-04-28 09:32:52,340 INFO L272 TraceCheckUtils]: 144: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,340 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55195#false} #128#return; {55195#false} is VALID [2022-04-28 09:32:52,340 INFO L290 TraceCheckUtils]: 149: Hoare triple {55195#false} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 150: Hoare triple {55195#false} assume !!(~j~0 <= ~r~0); {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 151: Hoare triple {55195#false} assume !(~j~0 < ~r~0); {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L272 TraceCheckUtils]: 152: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55195#false} #118#return; {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L272 TraceCheckUtils]: 157: Hoare triple {55195#false} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,341 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55195#false} #120#return; {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 162: Hoare triple {55195#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L290 TraceCheckUtils]: 163: Hoare triple {55195#false} assume !(0 != #t~nondet5);havoc #t~nondet5; {55195#false} is VALID [2022-04-28 09:32:52,341 INFO L272 TraceCheckUtils]: 164: Hoare triple {55195#false} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:52,342 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55195#false} #122#return; {55195#false} is VALID [2022-04-28 09:32:52,342 INFO L272 TraceCheckUtils]: 169: Hoare triple {55195#false} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55195#false} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 170: Hoare triple {55195#false} ~cond := #in~cond; {55195#false} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 171: Hoare triple {55195#false} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 09:32:52,342 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 09:32:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-04-28 09:32:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:32:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875608981] [2022-04-28 09:32:52,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875608981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:32:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025672942] [2022-04-28 09:32:52,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:32:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:32:52,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:32:52,355 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:32:52,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 09:32:52,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:32:52,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:32:52,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:32:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:32:52,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:32:53,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-28 09:32:53,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#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(9, 2); {55194#true} is VALID [2022-04-28 09:32:53,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 09:32:53,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-28 09:32:53,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-28 09:32:53,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~j~0 <= ~r~0); {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !(~j~0 < ~r~0); {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #118#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,651 INFO L272 TraceCheckUtils]: 16: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,651 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #120#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume 0 != #t~nondet5;havoc #t~nondet5; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume ~l~0 > 1; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,653 INFO L272 TraceCheckUtils]: 24: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,669 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #130#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,669 INFO L272 TraceCheckUtils]: 29: Hoare triple {55335#(<= main_~r~0 main_~n~0)} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,670 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {55335#(<= main_~r~0 main_~n~0)} #132#return; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {55335#(<= main_~r~0 main_~n~0)} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {55335#(<= main_~r~0 main_~n~0)} is VALID [2022-04-28 09:32:53,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {55335#(<= main_~r~0 main_~n~0)} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,672 INFO L272 TraceCheckUtils]: 38: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,673 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,673 INFO L272 TraceCheckUtils]: 43: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,673 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,673 INFO L272 TraceCheckUtils]: 48: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,674 INFO L272 TraceCheckUtils]: 53: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,675 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,676 INFO L272 TraceCheckUtils]: 60: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,676 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,676 INFO L272 TraceCheckUtils]: 65: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,677 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,677 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,677 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,677 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,678 INFO L290 TraceCheckUtils]: 71: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,678 INFO L272 TraceCheckUtils]: 72: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,678 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,678 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,679 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,679 INFO L272 TraceCheckUtils]: 77: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,679 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,679 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,679 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,679 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,680 INFO L272 TraceCheckUtils]: 82: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,680 INFO L272 TraceCheckUtils]: 87: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,681 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,681 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,681 INFO L290 TraceCheckUtils]: 92: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !!(~j~0 <= ~r~0); {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,682 INFO L290 TraceCheckUtils]: 94: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume ~j~0 < ~r~0; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,682 INFO L272 TraceCheckUtils]: 95: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,682 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,682 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,682 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,683 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #110#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,683 INFO L272 TraceCheckUtils]: 100: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,683 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,683 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #112#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,684 INFO L272 TraceCheckUtils]: 105: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #114#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,684 INFO L272 TraceCheckUtils]: 110: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,684 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,685 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,685 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,685 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #116#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,685 INFO L290 TraceCheckUtils]: 115: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,686 INFO L290 TraceCheckUtils]: 116: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,686 INFO L272 TraceCheckUtils]: 117: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,686 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,686 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,686 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,686 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #118#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,686 INFO L272 TraceCheckUtils]: 122: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,686 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,687 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,687 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,687 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #120#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,687 INFO L290 TraceCheckUtils]: 127: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,688 INFO L290 TraceCheckUtils]: 128: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,688 INFO L272 TraceCheckUtils]: 129: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,688 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,688 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,688 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,688 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #122#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,689 INFO L272 TraceCheckUtils]: 134: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #124#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,689 INFO L272 TraceCheckUtils]: 139: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,689 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,690 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #126#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,690 INFO L272 TraceCheckUtils]: 144: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,690 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,690 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,690 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,691 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} #128#return; {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} is VALID [2022-04-28 09:32:53,691 INFO L290 TraceCheckUtils]: 149: Hoare triple {55423#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55766#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} is VALID [2022-04-28 09:32:53,692 INFO L290 TraceCheckUtils]: 150: Hoare triple {55766#(and (< 1 main_~r~0) (<= main_~r~0 main_~n~0) (<= main_~i~0 (div main_~j~0 2)))} assume !!(~j~0 <= ~r~0); {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,692 INFO L290 TraceCheckUtils]: 151: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(~j~0 < ~r~0); {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,692 INFO L272 TraceCheckUtils]: 152: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,692 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,692 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,692 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,693 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #118#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,693 INFO L272 TraceCheckUtils]: 157: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,693 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,693 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,693 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,693 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #120#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,694 INFO L290 TraceCheckUtils]: 162: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,694 INFO L290 TraceCheckUtils]: 163: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,694 INFO L272 TraceCheckUtils]: 164: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:53,694 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:53,694 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:53,694 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:53,695 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} #122#return; {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} is VALID [2022-04-28 09:32:53,695 INFO L272 TraceCheckUtils]: 169: Hoare triple {55770#(and (<= main_~i~0 (div main_~n~0 2)) (< 1 main_~n~0))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:53,696 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:53,696 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 09:32:53,696 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 09:32:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 69 proven. 19 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-04-28 09:32:53,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:32:54,577 INFO L290 TraceCheckUtils]: 172: Hoare triple {55195#false} assume !false; {55195#false} is VALID [2022-04-28 09:32:54,578 INFO L290 TraceCheckUtils]: 171: Hoare triple {55832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {55195#false} is VALID [2022-04-28 09:32:54,578 INFO L290 TraceCheckUtils]: 170: Hoare triple {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:32:54,578 INFO L272 TraceCheckUtils]: 169: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:32:54,579 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #122#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,579 INFO L290 TraceCheckUtils]: 167: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,579 INFO L290 TraceCheckUtils]: 166: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,579 INFO L290 TraceCheckUtils]: 165: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,579 INFO L272 TraceCheckUtils]: 164: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,580 INFO L290 TraceCheckUtils]: 163: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,580 INFO L290 TraceCheckUtils]: 162: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,580 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #120#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,580 INFO L290 TraceCheckUtils]: 160: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,580 INFO L290 TraceCheckUtils]: 159: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,580 INFO L290 TraceCheckUtils]: 158: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,581 INFO L272 TraceCheckUtils]: 157: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,581 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {55194#true} {55848#(<= main_~i~0 main_~n~0)} #118#return; {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,581 INFO L290 TraceCheckUtils]: 155: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,581 INFO L290 TraceCheckUtils]: 154: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,581 INFO L290 TraceCheckUtils]: 153: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,581 INFO L272 TraceCheckUtils]: 152: Hoare triple {55848#(<= main_~i~0 main_~n~0)} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,582 INFO L290 TraceCheckUtils]: 151: Hoare triple {55848#(<= main_~i~0 main_~n~0)} assume !(~j~0 < ~r~0); {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,582 INFO L290 TraceCheckUtils]: 150: Hoare triple {55906#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} assume !!(~j~0 <= ~r~0); {55848#(<= main_~i~0 main_~n~0)} is VALID [2022-04-28 09:32:54,583 INFO L290 TraceCheckUtils]: 149: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55906#(or (<= main_~i~0 main_~n~0) (not (<= main_~j~0 main_~r~0)))} is VALID [2022-04-28 09:32:54,583 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,583 INFO L290 TraceCheckUtils]: 147: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,583 INFO L290 TraceCheckUtils]: 146: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,583 INFO L290 TraceCheckUtils]: 145: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,583 INFO L272 TraceCheckUtils]: 144: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,584 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,584 INFO L290 TraceCheckUtils]: 142: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,584 INFO L290 TraceCheckUtils]: 141: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,584 INFO L290 TraceCheckUtils]: 140: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,584 INFO L272 TraceCheckUtils]: 139: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,584 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 137: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 136: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 135: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L272 TraceCheckUtils]: 134: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 132: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 131: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,585 INFO L290 TraceCheckUtils]: 130: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,586 INFO L272 TraceCheckUtils]: 129: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,586 INFO L290 TraceCheckUtils]: 128: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,586 INFO L290 TraceCheckUtils]: 127: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,587 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 125: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 124: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 123: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L272 TraceCheckUtils]: 122: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 120: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 119: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,587 INFO L290 TraceCheckUtils]: 118: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,588 INFO L272 TraceCheckUtils]: 117: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,588 INFO L290 TraceCheckUtils]: 116: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,588 INFO L290 TraceCheckUtils]: 115: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,589 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,589 INFO L290 TraceCheckUtils]: 113: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,589 INFO L290 TraceCheckUtils]: 112: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,589 INFO L290 TraceCheckUtils]: 111: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,589 INFO L272 TraceCheckUtils]: 110: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,589 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,589 INFO L290 TraceCheckUtils]: 108: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L290 TraceCheckUtils]: 107: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L290 TraceCheckUtils]: 106: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L272 TraceCheckUtils]: 105: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,590 INFO L290 TraceCheckUtils]: 103: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,590 INFO L272 TraceCheckUtils]: 100: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,591 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,591 INFO L290 TraceCheckUtils]: 98: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,591 INFO L272 TraceCheckUtils]: 95: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} ~i~0 := ~j~0;~j~0 := 2 * ~j~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,592 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #128#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 90: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L272 TraceCheckUtils]: 87: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #126#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,594 INFO L272 TraceCheckUtils]: 82: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,594 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #124#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,594 INFO L272 TraceCheckUtils]: 77: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~i~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,595 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #122#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,595 INFO L272 TraceCheckUtils]: 72: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~i~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet5);havoc #t~nondet5; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,596 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #120#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,596 INFO L272 TraceCheckUtils]: 65: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,597 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #118#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,597 INFO L272 TraceCheckUtils]: 60: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !(0 != #t~nondet4);havoc #t~nondet4; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,598 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #116#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,598 INFO L272 TraceCheckUtils]: 53: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 + ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,599 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #114#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,599 INFO L272 TraceCheckUtils]: 48: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= 1 + ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #112#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L272 TraceCheckUtils]: 43: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {55194#true} {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} #110#return; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,601 INFO L272 TraceCheckUtils]: 38: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume ~j~0 < ~r~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} assume !!(~j~0 <= ~r~0); {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {55910#(<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1))} is VALID [2022-04-28 09:32:54,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #t~post6 := ~l~0;~l~0 := #t~post6 - 1;havoc #t~post6; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,602 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #132#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L272 TraceCheckUtils]: 29: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~l~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #130#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,603 INFO L272 TraceCheckUtils]: 24: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~l~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume 0 != #t~nondet5;havoc #t~nondet5; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,605 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #120#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,605 INFO L272 TraceCheckUtils]: 16: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if ~j~0 <= ~n~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,606 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55194#true} {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} #118#return; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {55194#true} assume !(0 == ~cond); {55194#true} is VALID [2022-04-28 09:32:54,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {55194#true} ~cond := #in~cond; {55194#true} is VALID [2022-04-28 09:32:54,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} call __VERIFIER_assert((if 1 <= ~j~0 then 1 else 0)); {55194#true} is VALID [2022-04-28 09:32:54,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !(~j~0 < ~r~0); {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~j~0 <= ~r~0); {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume !!(~r~0 > 1);~i~0 := ~l~0;~j~0 := 2 * ~l~0; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} assume ~l~0 > 1;#t~post2 := ~l~0;~l~0 := #t~post2 - 1;havoc #t~post2; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {55194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000000);~l~0 := 1 + (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2);~r~0 := ~n~0; {56253#(or (not (< 1 main_~r~0)) (<= (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~n~0 1)))} is VALID [2022-04-28 09:32:54,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {55194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {55194#true} is VALID [2022-04-28 09:32:54,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {55194#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {55194#true} is VALID [2022-04-28 09:32:54,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55194#true} {55194#true} #138#return; {55194#true} is VALID [2022-04-28 09:32:54,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {55194#true} assume true; {55194#true} is VALID [2022-04-28 09:32:54,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {55194#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(9, 2); {55194#true} is VALID [2022-04-28 09:32:54,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {55194#true} call ULTIMATE.init(); {55194#true} is VALID [2022-04-28 09:32:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 66 proven. 22 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-04-28 09:32:54,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025672942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:32:54,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:32:54,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-28 09:32:54,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:32:54,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506142818] [2022-04-28 09:32:54,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506142818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:32:54,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:32:54,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:32:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598875560] [2022-04-28 09:32:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:32:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 173 [2022-04-28 09:32:54,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:32:54,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-28 09:32:54,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:54,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:32:54,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:32:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:32:54,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:32:54,676 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-28 09:32:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:57,186 INFO L93 Difference]: Finished difference Result 318 states and 407 transitions. [2022-04-28 09:32:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:32:57,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 173 [2022-04-28 09:32:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:32:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-28 09:32:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-28 09:32:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-28 09:32:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2022-04-28 09:32:57,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2022-04-28 09:32:57,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:57,349 INFO L225 Difference]: With dead ends: 318 [2022-04-28 09:32:57,349 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:32:57,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:32:57,351 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:32:57,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 60 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:32:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:32:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:32:57,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:32:57,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:32:57,351 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:32:57,351 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:32:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:57,352 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:32:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:32:57,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:57,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:57,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:32:57,352 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:32:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:32:57,352 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:32:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:32:57,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:57,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:32:57,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:32:57,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:32:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:32:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:32:57,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-04-28 09:32:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:32:57,353 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:32:57,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-04-28 09:32:57,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:32:57,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:32:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:32:57,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:32:57,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:32:57,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 09:32:57,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 09:32:57,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:34:30,883 WARN L232 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 395 DAG size of output: 395 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)